Base | Representation |
---|---|
bin | 10110101111001110001110… |
… | …010111111101110110100101 |
3 | 111010002002221010210102010002 |
4 | 112233032032113331312211 |
5 | 101101413311210400401 |
6 | 552404200334311045 |
7 | 30030625364431106 |
oct | 2657161627756645 |
9 | 433062833712102 |
10 | 100002112200101 |
11 | 299557263183a1 |
12 | b2710b5058485 |
13 | 43a520a915ba7 |
14 | 1a9a1b15563ad |
15 | b8643ee46a6b |
hex | 5af38e5fdda5 |
100002112200101 has 8 divisors (see below), whose sum is σ = 101715851139360. Its totient is φ = 98288999523792.
The previous prime is 100002112200071. The next prime is 100002112200127. The reversal of 100002112200101 is 101002211200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100002112200101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002112202101) 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, 156243635 + ... + 156882368.
It is an arithmetic number, because the mean of its divisors is an integer number (12714481392420).
Almost surely, 2100002112200101 is an apocalyptic number.
It is an amenable number.
100002112200101 is a deficient number, since it is larger than the sum of its proper divisors (1713738939259).
100002112200101 is an equidigital number, since it uses as much as digits as its factorization.
100002112200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313131475.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100002112200101 its reverse (101002211200001), we get a palindrome (201004323400102).
The spelling of 100002112200101 in words is "one hundred trillion, two billion, one hundred twelve million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •