Base | Representation |
---|---|
bin | 1001000110110001100110… |
… | …1101011010001011110110 |
3 | 1022110010201111112112212122 |
4 | 2101230121231122023312 |
5 | 2303014034011213420 |
6 | 33143241020515542 |
7 | 2052225460461650 |
oct | 221543155321366 |
9 | 38403644475778 |
10 | 10012000101110 |
11 | 321007a054657 |
12 | 11584866abbb2 |
13 | 578187327077 |
14 | 268824b756d0 |
15 | 12567d6d3725 |
hex | 91b19b5a2f6 |
10012000101110 has 32 divisors (see below), whose sum is σ = 20903519197440. Its totient is φ = 3381451631712.
The previous prime is 10012000101091. The next prime is 10012000101119. The reversal of 10012000101110 is 1110100021001.
It is a happy number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012000101119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1067372720 + ... + 1067382099.
It is an arithmetic number, because the mean of its divisors is an integer number (653234974920).
Almost surely, 210012000101110 is an apocalyptic number.
10012000101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10012000101110 is an abundant number, since it is smaller than the sum of its proper divisors (10891519096330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012000101110 is a wasteful number, since it uses less digits than its factorization.
10012000101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2134754900.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10012000101110 its reverse (1110100021001), we get a palindrome (11122100122111).
The spelling of 10012000101110 in words is "ten trillion, twelve billion, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •