Base | Representation |
---|---|
bin | 111100010100100… |
… | …001000000000101 |
3 | 2121112021111010101 |
4 | 330110201000011 |
5 | 4033033323023 |
6 | 244230524101 |
7 | 34035644266 |
oct | 7424410005 |
9 | 2545244111 |
10 | 1012011013 |
11 | 47a287942 |
12 | 242b06631 |
13 | 1318841b0 |
14 | 9859696d |
15 | 5dca51ad |
hex | 3c521005 |
1012011013 has 8 divisors (see below), whose sum is σ = 1119314168. Its totient is φ = 908915904.
The previous prime is 1012010981. The next prime is 1012011023. The reversal of 1012011013 is 3101102101.
It can be written as a sum of positive squares in 4 ways, for example, as 12376324 + 999634689 = 3518^2 + 31617^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012011013 - 25 = 1012010981 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 (1012011023) 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, 1051506 + ... + 1052467.
It is an arithmetic number, because the mean of its divisors is an integer number (139914271).
Almost surely, 21012011013 is an apocalyptic number.
1012011013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1012011013 is a deficient number, since it is larger than the sum of its proper divisors (107303155).
1012011013 is a wasteful number, since it uses less digits than its factorization.
1012011013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2104023.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1012011013 is about 31812.1205360473. The cubic root of 1012011013 is about 1003.9877477301.
Adding to 1012011013 its reverse (3101102101), we get a palindrome (4113113114).
The spelling of 1012011013 in words is "one billion, twelve million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •