Base | Representation |
---|---|
bin | 1001001100100110001001… |
… | …0010011101101011101000 |
3 | 1022210200211210210111020212 |
4 | 2103021202102131223220 |
5 | 2311133340004201440 |
6 | 33301220053040252 |
7 | 2062365560001035 |
oct | 223114222355350 |
9 | 38720753714225 |
10 | 10112002022120 |
11 | 3249526581a69 |
12 | 1173935026088 |
13 | 584733359cab |
14 | 26d5d017638c |
15 | 128082b9c465 |
hex | 9326249dae8 |
10112002022120 has 64 divisors (see below), whose sum is σ = 24096976441920. Its totient is φ = 3805825434624.
The previous prime is 10112002022107. The next prime is 10112002022123. The reversal of 10112002022120 is 2122020021101.
It is a junction number, because it is equal to n+sod(n) for n = 10112002022095 and 10112002022104.
It is not an unprimeable number, because it can be changed into a prime (10112002022123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 436259 + ... + 4518221.
It is an arithmetic number, because the mean of its divisors is an integer number (376515256905).
Almost surely, 210112002022120 is an apocalyptic number.
10112002022120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112002022120 is an abundant number, since it is smaller than the sum of its proper divisors (13984974419800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112002022120 is a wasteful number, since it uses less digits than its factorization.
10112002022120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4085634 (or 4085630 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10112002022120 its reverse (2122020021101), we get a palindrome (12234022043221).
The spelling of 10112002022120 in words is "ten trillion, one hundred twelve billion, two million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •