Base | Representation |
---|---|
bin | 1001001001100100011100… |
… | …00011100000110110001110 |
3 | 2122020110021002122020220100 |
4 | 10210302032003200312032 |
5 | 10114121240041200420 |
6 | 110443001031031530 |
7 | 4144423415031444 |
oct | 444621603406616 |
9 | 78213232566810 |
10 | 20120010100110 |
11 | 64579371a0558 |
12 | 230b48680b5a6 |
13 | b2c4025c63ab |
14 | 4d7b56a72b94 |
15 | 24d57ab84190 |
hex | 124c8e0e0d8e |
20120010100110 has 48 divisors (see below), whose sum is σ = 52312265126784. Its totient is φ = 5365311527616.
The previous prime is 20120010100109. The next prime is 20120010100129. The reversal of 20120010100110 is 1100101002102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20120010100092 and 20120010100101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 28284259 + ... + 28986881.
It is an arithmetic number, because the mean of its divisors is an integer number (1089838856808).
Almost surely, 220120010100110 is an apocalyptic number.
20120010100110 is an abundant number, since it is smaller than the sum of its proper divisors (32192255026674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20120010100110 is a wasteful number, since it uses less digits than its factorization.
20120010100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020809 (or 1020806 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20120010100110 its reverse (1100101002102), we get a palindrome (21220111102212).
The spelling of 20120010100110 in words is "twenty trillion, one hundred twenty billion, ten million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •