Base | Representation |
---|---|
bin | 11001000011101001101101… |
… | …000010010011101010001001 |
3 | 112110012012212211201210022020 |
4 | 121003221231002103222021 |
5 | 103421022400122431441 |
6 | 1030214051304315053 |
7 | 32132560530062034 |
oct | 3103515502235211 |
9 | 473165784653266 |
10 | 110202100202121 |
11 | 321284a2668324 |
12 | 10439aa4472a89 |
13 | 496502374c485 |
14 | 1d2db4ad2201b |
15 | cb192223de66 |
hex | 643a6d093a89 |
110202100202121 has 16 divisors (see below), whose sum is σ = 147237217691328. Its totient is φ = 73317528468800.
The previous prime is 110202100202111. The next prime is 110202100202137. The reversal of 110202100202121 is 121202001202011.
It is a cyclic number.
It is not a de Polignac number, because 110202100202121 - 213 = 110202100193929 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110202100202121.
It is not an unprimeable number, because it can be changed into a prime (110202100202111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131062375 + ... + 131900531.
It is an arithmetic number, because the mean of its divisors is an integer number (9202326105708).
Almost surely, 2110202100202121 is an apocalyptic number.
It is an amenable number.
110202100202121 is a deficient number, since it is larger than the sum of its proper divisors (37035117489207).
110202100202121 is an equidigital number, since it uses as much as digits as its factorization.
110202100202121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927912.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110202100202121 its reverse (121202001202011), we get a palindrome (231404101404132).
The spelling of 110202100202121 in words is "one hundred ten trillion, two hundred two billion, one hundred million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •