Base | Representation |
---|---|
bin | 10110110000101001100100… |
… | …110111101011111110010011 |
3 | 111010102111010001112000212002 |
4 | 112300221210313223332103 |
5 | 101110020202212321321 |
6 | 552521221435024215 |
7 | 30041000163125504 |
oct | 2660514467537623 |
9 | 433374101460762 |
10 | 100100200120211 |
11 | 299932903a7585 |
12 | b28810a59b06b |
13 | 43b15402525c5 |
14 | 1aa0c38686bab |
15 | b88c8138920b |
hex | 5b0a64debf93 |
100100200120211 has 4 divisors (see below), whose sum is σ = 100113111284952. Its totient is φ = 100087288955472.
The previous prime is 100100200120139. The next prime is 100100200120273. The reversal of 100100200120211 is 112021002001001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100100200120211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100100200120192 and 100100200120201.
It is not an unprimeable number, because it can be changed into a prime (100100200140211) 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, 6455570741 + ... + 6455586246.
It is an arithmetic number, because the mean of its divisors is an integer number (25028277821238).
Almost surely, 2100100200120211 is an apocalyptic number.
100100200120211 is a deficient number, since it is larger than the sum of its proper divisors (12911164741).
100100200120211 is an equidigital number, since it uses as much as digits as its factorization.
100100200120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12911164740.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100100200120211 its reverse (112021002001001), we get a palindrome (212121202121212).
The spelling of 100100200120211 in words is "one hundred trillion, one hundred billion, two hundred million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •