Base | Representation |
---|---|
bin | 11001000011101001100111… |
… | …001011101111011111011000 |
3 | 112110012012121222222012221112 |
4 | 121003221213023233133120 |
5 | 103421022200003341440 |
6 | 1030214033435555452 |
7 | 32132555225345564 |
oct | 3103514713573730 |
9 | 473165558865845 |
10 | 110202002012120 |
11 | 321284521a2767 |
12 | 10439a775bbb88 |
13 | 49650092c0795 |
14 | 1d2db3bc826a4 |
15 | cb19187e5965 |
hex | 643a672ef7d8 |
110202002012120 has 64 divisors (see below), whose sum is σ = 252055544644800. Its totient is φ = 43351934676480.
The previous prime is 110202002012117. The next prime is 110202002012131. The reversal of 110202002012120 is 21210200202011.
It is a junction number, because it is equal to n+sod(n) for n = 110202002012095 and 110202002012104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13758146 + ... + 20240814.
It is an arithmetic number, because the mean of its divisors is an integer number (3938367885075).
Almost surely, 2110202002012120 is an apocalyptic number.
110202002012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110202002012120 is an abundant number, since it is smaller than the sum of its proper divisors (141853542632680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110202002012120 is a wasteful number, since it uses less digits than its factorization.
110202002012120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6489708 (or 6489704 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110202002012120 its reverse (21210200202011), we get a palindrome (131412202214131).
The spelling of 110202002012120 in words is "one hundred ten trillion, two hundred two billion, two million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •