Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1000110000110010011011 |
3 | 1022202120011210221200221202 |
4 | 2102332132020300302123 |
5 | 2310440022012210021 |
6 | 33251533122024415 |
7 | 2061465263523620 |
oct | 222763610606233 |
9 | 38676153850852 |
10 | 10100121210011 |
11 | 324448a127a88 |
12 | 117157a1a810b |
13 | 58358bac6861 |
14 | 26cbc4302347 |
15 | 127ad9b21a0b |
hex | 92f9e230c9b |
10100121210011 has 16 divisors (see below), whose sum is σ = 11567265228288. Its totient is φ = 8639048520000.
The previous prime is 10100121209989. The next prime is 10100121210013. The reversal of 10100121210011 is 11001212100101.
10100121210011 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 10100121210011 - 210 = 10100121208987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10100121209974 and 10100121210001.
It is not an unprimeable number, because it can be changed into a prime (10100121210013) 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, 31533176 + ... + 31851866.
It is an arithmetic number, because the mean of its divisors is an integer number (722954076768).
Almost surely, 210100121210011 is an apocalyptic number.
10100121210011 is a deficient number, since it is larger than the sum of its proper divisors (1467144018277).
10100121210011 is an equidigital number, since it uses as much as digits as its factorization.
10100121210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328202.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10100121210011 its reverse (11001212100101), we get a palindrome (21101333310112).
The spelling of 10100121210011 in words is "ten trillion, one hundred billion, one hundred twenty-one million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •