Base | Representation |
---|---|
bin | 1001000110110001100111… |
… | …0000110101111000110011 |
3 | 1022110010201120020021022022 |
4 | 2101230121300311320303 |
5 | 2303014034224013021 |
6 | 33143241052102055 |
7 | 2052225501230402 |
oct | 221543160657063 |
9 | 38403646207268 |
10 | 10012001001011 |
11 | 321007a609779 |
12 | 1158486a6492b |
13 | 578187580859 |
14 | 268824d2b639 |
15 | 12567d8101ab |
hex | 91b19c35e33 |
10012001001011 has 16 divisors (see below), whose sum is σ = 10192604685120. Its totient is φ = 9831932651520.
The previous prime is 10012001001007. The next prime is 10012001001019. The reversal of 10012001001011 is 11010010021001.
It is a happy number.
10012001001011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10012001001011 - 22 = 10012001001007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10012001001011.
It is not an unprimeable number, because it can be changed into a prime (10012001001019) 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, 490942631 + ... + 490963023.
It is an arithmetic number, because the mean of its divisors is an integer number (637037792820).
Almost surely, 210012001001011 is an apocalyptic number.
10012001001011 is a deficient number, since it is larger than the sum of its proper divisors (180603684109).
10012001001011 is a wasteful number, since it uses less digits than its factorization.
10012001001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33086.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10012001001011 its reverse (11010010021001), we get a palindrome (21022011022012).
The spelling of 10012001001011 in words is "ten trillion, twelve billion, one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •