Base | Representation |
---|---|
bin | 11011100011110101101110… |
… | …001001101111111111000010 |
3 | 120220011120111200021000000110 |
4 | 123203311232021233333002 |
5 | 111341401311222010033 |
6 | 1105443054354332150 |
7 | 34350066525332142 |
oct | 3343655611577702 |
9 | 526146450230013 |
10 | 121210120110018 |
11 | 35691a17951795 |
12 | 117173bbb8a056 |
13 | 52830b0566b54 |
14 | 21d085b664922 |
15 | e02e47a27363 |
hex | 6e3d6e26ffc2 |
121210120110018 has 32 divisors (see below), whose sum is σ = 243151583088960. Its totient is φ = 40281494722560.
The previous prime is 121210120110017. The next prime is 121210120110097. The reversal of 121210120110018 is 810011021012121.
It is a junction number, because it is equal to n+sod(n) for n = 121210120109976 and 121210120110003.
It is not an unprimeable number, because it can be changed into a prime (121210120110011) 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 15 ways as a sum of consecutive naturals, for example, 39802578 + ... + 42739506.
It is an arithmetic number, because the mean of its divisors is an integer number (7598486971530).
Almost surely, 2121210120110018 is an apocalyptic number.
121210120110018 is an abundant number, since it is smaller than the sum of its proper divisors (121941462978942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121210120110018 is a wasteful number, since it uses less digits than its factorization.
121210120110018 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2957682.
The product of its (nonzero) digits is 64, while the sum is 21.
Adding to 121210120110018 its reverse (810011021012121), we get a palindrome (931221141122139).
The spelling of 121210120110018 in words is "one hundred twenty-one trillion, two hundred ten billion, one hundred twenty million, one hundred ten thousand, eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •