Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …101111011000101101110101 |
3 | 111010102200022012201222112211 |
4 | 112300223130233120231311 |
5 | 101110033312032210401 |
6 | 552522153155413421 |
7 | 30041101053116362 |
oct | 2660533457305565 |
9 | 433380265658484 |
10 | 100102211210101 |
11 | 29994122629141 |
12 | b28858bbb4271 |
13 | 43b17a0ab0619 |
14 | 1aa0d897cb469 |
15 | b88d4cbdc951 |
hex | 5b0adcbd8b75 |
100102211210101 has 8 divisors (see below), whose sum is σ = 100938449304000. Its totient is φ = 99267065526720.
The previous prime is 100102211210069. The next prime is 100102211210123. The reversal of 100102211210101 is 101012112201001.
It is a happy number.
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 100102211210101 - 25 = 100102211210069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102211210201) 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, 272918596 + ... + 273285133.
It is an arithmetic number, because the mean of its divisors is an integer number (12617306163000).
Almost surely, 2100102211210101 is an apocalyptic number.
It is an amenable number.
100102211210101 is a deficient number, since it is larger than the sum of its proper divisors (836238093899).
100102211210101 is a wasteful number, since it uses less digits than its factorization.
100102211210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546205259.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100102211210101 its reverse (101012112201001), we get a palindrome (201114323411102).
The spelling of 100102211210101 in words is "one hundred trillion, one hundred two billion, two hundred eleven million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •