Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …001100101101111101111111 |
3 | 111010102200021120122021011121 |
4 | 112300223130030231331333 |
5 | 101110033302220401421 |
6 | 552522152232531411 |
7 | 30041100612635650 |
oct | 2660533414557577 |
9 | 433380246567147 |
10 | 100102202122111 |
11 | 29994118491202 |
12 | b288588b50b67 |
13 | 43b179bc4ac07 |
14 | 1aa0d88503527 |
15 | b88d4bee4d41 |
hex | 5b0adc32df7f |
100102202122111 has 8 divisors (see below), whose sum is σ = 114405632456864. Its totient is φ = 85799550723840.
The previous prime is 100102202122093. The next prime is 100102202122151. The reversal of 100102202122111 is 111221202201001.
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 100102202122111 - 25 = 100102202122079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102202122151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 194458710 + ... + 194972803.
It is an arithmetic number, because the mean of its divisors is an integer number (14300704057108).
Almost surely, 2100102202122111 is an apocalyptic number.
100102202122111 is a deficient number, since it is larger than the sum of its proper divisors (14303430334753).
100102202122111 is an equidigital number, since it uses as much as digits as its factorization.
100102202122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389468241.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 100102202122111 its reverse (111221202201001), we get a palindrome (211323404323112).
The spelling of 100102202122111 in words is "one hundred trillion, one hundred two billion, two hundred two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •