Base | Representation |
---|---|
bin | 10110101111001110001110… |
… | …010000010101100110010011 |
3 | 111010002002221000000210210002 |
4 | 112233032032100111212103 |
5 | 101101413310202401321 |
6 | 552404200223400215 |
7 | 30030625341431402 |
oct | 2657161620254623 |
9 | 433062830023702 |
10 | 100002110200211 |
11 | 2995572518189a |
12 | b2710b445306b |
13 | 43a520a39581b |
14 | 1a9a1b1195639 |
15 | b8643eb9e20b |
hex | 5af38e415993 |
100002110200211 has 4 divisors (see below), whose sum is σ = 100010456937024. Its totient is φ = 99993763463400.
The previous prime is 100002110200207. The next prime is 100002110200243. The reversal of 100002110200211 is 112002011200001.
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 100002110200211 - 22 = 100002110200207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100002110200192 and 100002110200201.
It is not an unprimeable number, because it can be changed into a prime (100002110200261) 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, 4173350435 + ... + 4173374396.
It is an arithmetic number, because the mean of its divisors is an integer number (25002614234256).
Almost surely, 2100002110200211 is an apocalyptic number.
100002110200211 is a deficient number, since it is larger than the sum of its proper divisors (8346736813).
100002110200211 is an equidigital number, since it uses as much as digits as its factorization.
100002110200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8346736812.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100002110200211 its reverse (112002011200001), we get a palindrome (212004121400212).
The spelling of 100002110200211 in words is "one hundred trillion, two billion, one hundred ten million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •