Base | Representation |
---|---|
bin | 1001001001100110100000… |
… | …10001101101111101101110 |
3 | 2122020120010112012220211020 |
4 | 10210303100101231331232 |
5 | 10114131024001320420 |
6 | 110443303200035010 |
7 | 4144463065403013 |
oct | 444632021557556 |
9 | 78216115186736 |
10 | 20121121120110 |
11 | 64583573522aa |
12 | 230b736902a66 |
13 | b2c54b834c8a |
14 | 4d7c2043d70a |
15 | 24d5e3495340 |
hex | 124cd046df6e |
20121121120110 has 64 divisors (see below), whose sum is σ = 49651053871104. Its totient is φ = 5215446662400.
The previous prime is 20121121119997. The next prime is 20121121120147. The reversal of 20121121120110 is 1102112112102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 20121121120110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29848654 + ... + 30515313.
It is an arithmetic number, because the mean of its divisors is an integer number (775797716736).
Almost surely, 220121121120110 is an apocalyptic number.
20121121120110 is an abundant number, since it is smaller than the sum of its proper divisors (29529932750994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20121121120110 is a wasteful number, since it uses less digits than its factorization.
20121121120110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60364289.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20121121120110 its reverse (1102112112102), we get a palindrome (21223233232212).
The spelling of 20121121120110 in words is "twenty trillion, one hundred twenty-one billion, one hundred twenty-one million, one hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •