Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101011100100111001000 |
3 | 1110101001122222201121102201 |
4 | 2201310103231130213020 |
5 | 2424142230224310440 |
6 | 35352242525405544 |
7 | 2225251664013562 |
oct | 241642355344710 |
9 | 43331588647381 |
10 | 11120001010120 |
11 | 35a7a69743a42 |
12 | 12b7169a098b4 |
13 | 6287c48a3112 |
14 | 2a62d4aa2332 |
15 | 1443cb7ae19a |
hex | a1d13b5c9c8 |
11120001010120 has 32 divisors (see below), whose sum is σ = 25059653680320. Its totient is φ = 4440951264960.
The previous prime is 11120001010061. The next prime is 11120001010133. The reversal of 11120001010120 is 2101010002111.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 11120001010097 and 11120001010106.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 220260042 + ... + 220310521.
It is an arithmetic number, because the mean of its divisors is an integer number (783114177510).
Almost surely, 211120001010120 is an apocalyptic number.
11120001010120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120001010120 is an abundant number, since it is smaller than the sum of its proper divisors (13939652670200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120001010120 is a wasteful number, since it uses less digits than its factorization.
11120001010120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440571205 (or 440571201 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11120001010120 its reverse (2101010002111), we get a palindrome (13221011012231).
The spelling of 11120001010120 in words is "eleven trillion, one hundred twenty billion, one million, ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •