Base | Representation |
---|---|
bin | 111100010100100… |
… | …001001111100001 |
3 | 2121112021112110222 |
4 | 330110201033201 |
5 | 4033033341001 |
6 | 244230532425 |
7 | 34035650210 |
oct | 7424411741 |
9 | 2545245428 |
10 | 1012012001 |
11 | 47a288660 |
12 | 242b07115 |
13 | 131884790 |
14 | 98597077 |
15 | 5dca561b |
hex | 3c5213e1 |
1012012001 has 16 divisors (see below), whose sum is σ = 1358786688. Its totient is φ = 727920000.
The previous prime is 1012011971. The next prime is 1012012003. The reversal of 1012012001 is 1002102101.
It is a cyclic number.
It is not a de Polignac number, because 1012012001 - 226 = 944903137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1012012001.
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 15 ways as a sum of consecutive naturals, for example, 504500 + ... + 506501.
It is an arithmetic number, because the mean of its divisors is an integer number (84924168).
Almost surely, 21012012001 is an apocalyptic number.
1012012001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012012001 is a deficient number, since it is larger than the sum of its proper divisors (346774687).
1012012001 is a wasteful number, since it uses less digits than its factorization.
1012012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1011032.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 1012012001 is about 31812.1360647159. The cubic root of 1012012001 is about 1003.9880744524.
Adding to 1012012001 its reverse (1002102101), we get a palindrome (2014114102).
It can be divided in two parts, 101 and 2012001, that added together give a palindrome (2012102).
The spelling of 1012012001 in words is "one billion, twelve million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •