Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …111011100111001101111011 |
3 | 111010010001111122020222102002 |
4 | 112233113130323213031323 |
5 | 101102044104121231021 |
6 | 552412515431131215 |
7 | 30031426043261363 |
oct | 2657273473471573 |
9 | 433101448228362 |
10 | 100012020102011 |
11 | 29959950048786 |
12 | b272bbb213b0b |
13 | 43a61294c8444 |
14 | 1a9a8713839a3 |
15 | b8681ebb150b |
hex | 5af5dcee737b |
100012020102011 has 8 divisors (see below), whose sum is σ = 100309162446480. Its totient is φ = 99714879952128.
The previous prime is 100012020101923. The next prime is 100012020102019. The reversal of 100012020102011 is 110201020210001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100012020102011 - 210 = 100012020100987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100012020101983 and 100012020102001.
It is not an unprimeable number, because it can be changed into a prime (100012020102019) 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, 163067135 + ... + 163679303.
It is an arithmetic number, because the mean of its divisors is an integer number (12538645305810).
Almost surely, 2100012020102011 is an apocalyptic number.
100012020102011 is a deficient number, since it is larger than the sum of its proper divisors (297142344469).
100012020102011 is an equidigital number, since it uses as much as digits as its factorization.
100012020102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1097293.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100012020102011 its reverse (110201020210001), we get a palindrome (210213040312012).
The spelling of 100012020102011 in words is "one hundred trillion, twelve billion, twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •