Base | Representation |
---|---|
bin | 111110000000010… |
… | …000000001010101 |
3 | 2200111102022212101 |
4 | 332000100001111 |
5 | 4112301044023 |
6 | 251120122101 |
7 | 34531001422 |
oct | 7600200125 |
9 | 2614368771 |
10 | 1040253013 |
11 | 494217538 |
12 | 250466331 |
13 | 137691c37 |
14 | 9c228d49 |
15 | 614d31ad |
hex | 3e010055 |
1040253013 has 4 divisors (see below), whose sum is σ = 1057884480. Its totient is φ = 1022621548.
The previous prime is 1040253007. The next prime is 1040253029. The reversal of 1040253013 is 3103520401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3103520401 = 19 ⋅163343179.
It is a cyclic number.
It is not a de Polignac number, because 1040253013 - 25 = 1040252981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040253073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8815645 + ... + 8815762.
It is an arithmetic number, because the mean of its divisors is an integer number (264471120).
Almost surely, 21040253013 is an apocalyptic number.
It is an amenable number.
1040253013 is a deficient number, since it is larger than the sum of its proper divisors (17631467).
1040253013 is an equidigital number, since it uses as much as digits as its factorization.
1040253013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17631466.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 1040253013 is about 32252.9535546746. The cubic root of 1040253013 is about 1013.2415582161.
Adding to 1040253013 its reverse (3103520401), we get a palindrome (4143773414).
The spelling of 1040253013 in words is "one billion, forty million, two hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •