Base | Representation |
---|---|
bin | 1001001101001000011010… |
… | …0010110011011111011010 |
3 | 1022211120120211211100210221 |
4 | 2103102012202303133122 |
5 | 2311311204224020442 |
6 | 33305340514230254 |
7 | 2063142530252605 |
oct | 223220642633732 |
9 | 38746524740727 |
10 | 10121200220122 |
11 | 32524167352a2 |
12 | 117568158538a |
13 | 58556abb32c4 |
14 | 26dc23a2133c |
15 | 128420479467 |
hex | 934868b37da |
10121200220122 has 8 divisors (see below), whose sum is σ = 15182060632416. Its totient is φ = 5060513342652.
The previous prime is 10121200219969. The next prime is 10121200220123. The reversal of 10121200220122 is 22102200212101.
It is a happy number.
10121200220122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10121200220096 and 10121200220105.
It is not an unprimeable number, because it can be changed into a prime (10121200220123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43237798 + ... + 43471249.
It is an arithmetic number, because the mean of its divisors is an integer number (1897757579052).
Almost surely, 210121200220122 is an apocalyptic number.
10121200220122 is a deficient number, since it is larger than the sum of its proper divisors (5060860412294).
10121200220122 is an equidigital number, since it uses as much as digits as its factorization.
10121200220122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86767412.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10121200220122 its reverse (22102200212101), we get a palindrome (32223400432223).
The spelling of 10121200220122 in words is "ten trillion, one hundred twenty-one billion, two hundred million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •