Base | Representation |
---|---|
bin | 1001000111010011100101… |
… | …0111010001000100011111 |
3 | 1022111000021011022102001112 |
4 | 2101310321113101010133 |
5 | 2303141224000231421 |
6 | 33151350043332235 |
7 | 2053000502633420 |
oct | 221647127210437 |
9 | 38430234272045 |
10 | 10021121102111 |
11 | 3213a2a680709 |
12 | 115a1b122107b |
13 | 578cabb91a92 |
14 | 26904c287647 |
15 | 125a1431245b |
hex | 91d395d111f |
10021121102111 has 8 divisors (see below), whose sum is σ = 11453606006304. Its totient is φ = 8588860241760.
The previous prime is 10021121102107. The next prime is 10021121102123. The reversal of 10021121102111 is 11120112112001.
10021121102111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10021121102111 - 22 = 10021121102107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021121102141) 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, 55915100 + ... + 56094033.
It is an arithmetic number, because the mean of its divisors is an integer number (1431700750788).
Almost surely, 210021121102111 is an apocalyptic number.
10021121102111 is a deficient number, since it is larger than the sum of its proper divisors (1432484904193).
10021121102111 is a wasteful number, since it uses less digits than its factorization.
10021121102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112021921.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10021121102111 its reverse (11120112112001), we get a palindrome (21141233214112).
The spelling of 10021121102111 in words is "ten trillion, twenty-one billion, one hundred twenty-one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •