Base | Representation |
---|---|
bin | 11011010010001110101110… |
… | …101011110101100011111110 |
3 | 120201212220000212012021010201 |
4 | 123102032232223311203332 |
5 | 111212040021113310420 |
6 | 1103115125444354114 |
7 | 34163500261234444 |
oct | 3322165653654376 |
9 | 521786025167121 |
10 | 120000022010110 |
11 | 352657a6037790 |
12 | 115609846a593a |
13 | 51c5c51b64cc8 |
14 | 218c063d5cb94 |
15 | dd172155210a |
hex | 6d23aeaf58fe |
120000022010110 has 16 divisors (see below), whose sum is σ = 235636406856432. Its totient is φ = 43636371640000.
The previous prime is 120000022010101. The next prime is 120000022010111. The reversal of 120000022010110 is 11010220000021.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120000022010111) 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, 545454645391 + ... + 545454645610.
It is an arithmetic number, because the mean of its divisors is an integer number (14727275428527).
Almost surely, 2120000022010110 is an apocalyptic number.
120000022010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120000022010110 is a deficient number, since it is larger than the sum of its proper divisors (115636384846322).
120000022010110 is a wasteful number, since it uses less digits than its factorization.
120000022010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090909291019.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 120000022010110 its reverse (11010220000021), we get a palindrome (131010242010131).
The spelling of 120000022010110 in words is "one hundred twenty trillion, twenty-two million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •