Base | Representation |
---|---|
bin | 10110110000110100100100… |
… | …010100010010010101010011 |
3 | 111010110121120112211122122202 |
4 | 112300310210110102111103 |
5 | 101110213340003001321 |
6 | 552530452510153415 |
7 | 30041565510345065 |
oct | 2660644424222523 |
9 | 433417515748582 |
10 | 100112002000211 |
11 | 2999829723a713 |
12 | b28a462ab286b |
13 | 43b26a133a756 |
14 | 1aa1637c51735 |
15 | b8922252270b |
hex | 5b0d24512553 |
100112002000211 has 4 divisors (see below), whose sum is σ = 100164334465272. Its totient is φ = 100059669535152.
The previous prime is 100112002000147. The next prime is 100112002000217. The reversal of 100112002000211 is 112000200211001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100112002000211 - 26 = 100112002000147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100112002000192 and 100112002000201.
It is not an unprimeable number, because it can be changed into a prime (100112002000217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26166229661 + ... + 26166233486.
It is an arithmetic number, because the mean of its divisors is an integer number (25041083616318).
Almost surely, 2100112002000211 is an apocalyptic number.
100112002000211 is a deficient number, since it is larger than the sum of its proper divisors (52332465061).
100112002000211 is an equidigital number, since it uses as much as digits as its factorization.
100112002000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52332465060.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100112002000211 its reverse (112000200211001), we get a palindrome (212112202211212).
The spelling of 100112002000211 in words is "one hundred trillion, one hundred twelve billion, two million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •