Base | Representation |
---|---|
bin | 1001001101000011111100… |
… | …0001001000010010111110 |
3 | 1022211110111012210112112200 |
4 | 2103100333001020102332 |
5 | 2311301230023210420 |
6 | 33305021450012330 |
7 | 2063101016323260 |
oct | 223207701102276 |
9 | 38743435715480 |
10 | 10120000210110 |
11 | 3251960321a8a |
12 | 11753a77170a6 |
13 | 5854093b73cb |
14 | 26db4c4cbb30 |
15 | 12839ee3ab90 |
hex | 9343f0484be |
10120000210110 has 96 divisors (see below), whose sum is σ = 30580533434880. Its totient is φ = 2273937084864.
The previous prime is 10120000210109. The next prime is 10120000210147. The reversal of 10120000210110 is 1101200002101.
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 = 10120000210092 and 10120000210101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 136094122 + ... + 136168461.
It is an arithmetic number, because the mean of its divisors is an integer number (318547223280).
Almost surely, 210120000210110 is an apocalyptic number.
10120000210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10120000210110 is an abundant number, since it is smaller than the sum of its proper divisors (20460533224770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120000210110 is a wasteful number, since it uses less digits than its factorization.
10120000210110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272262662 (or 272262659 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10120000210110 its reverse (1101200002101), we get a palindrome (11221200212211).
The spelling of 10120000210110 in words is "ten trillion, one hundred twenty billion, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •