Base | Representation |
---|---|
bin | 111100010100100… |
… | …001001111101101 |
3 | 2121112021112111102 |
4 | 330110201033231 |
5 | 4033033341023 |
6 | 244230532445 |
7 | 34035650225 |
oct | 7424411755 |
9 | 2545245442 |
10 | 1012012013 |
11 | 47a288671 |
12 | 242b07125 |
13 | 13188479c |
14 | 98597085 |
15 | 5dca5628 |
hex | 3c5213ed |
1012012013 has 8 divisors (see below), whose sum is σ = 1021947960. Its totient is φ = 1002113280.
The previous prime is 1012012003. The next prime is 1012012031. The reversal of 1012012013 is 3102102101.
It can be written as a sum of positive squares in 4 ways, for example, as 569204164 + 442807849 = 23858^2 + 21043^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1012012013 - 28 = 1012011757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012011985 and 1012012003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012012003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47003 + ... + 65063.
It is an arithmetic number, because the mean of its divisors is an integer number (127743495).
Almost surely, 21012012013 is an apocalyptic number.
It is an amenable number.
1012012013 is a deficient number, since it is larger than the sum of its proper divisors (9935947).
1012012013 is a wasteful number, since it uses less digits than its factorization.
1012012013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18607.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1012012013 is about 31812.1362533232. The cubic root of 1012012013 is about 1003.9880784207.
Adding to 1012012013 its reverse (3102102101), we get a palindrome (4114114114).
The spelling of 1012012013 in words is "one billion, twelve million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •