Base | Representation |
---|---|
bin | 1010000111010001100110… |
… | …1011110000100110101100 |
3 | 1110101001220222022100122220 |
4 | 2201310121223300212230 |
5 | 2424142431403343040 |
6 | 35352300505435340 |
7 | 2225254321616025 |
oct | 241643153604654 |
9 | 43331828270586 |
10 | 11120101231020 |
11 | 35a8010276431 |
12 | 12b719749bb50 |
13 | 62880c593322 |
14 | 2a630410dc4c |
15 | 1443d54a92d0 |
hex | a1d19af09ac |
11120101231020 has 24 divisors (see below), whose sum is σ = 31136283447024. Its totient is φ = 2965360328256.
The previous prime is 11120101230967. The next prime is 11120101231021. The reversal of 11120101231020 is 2013210102111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (11120101231021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92667510199 + ... + 92667510318.
It is an arithmetic number, because the mean of its divisors is an integer number (1297345143626).
Almost surely, 211120101231020 is an apocalyptic number.
11120101231020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120101231020 is an abundant number, since it is smaller than the sum of its proper divisors (20016182216004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120101231020 is a wasteful number, since it uses less digits than its factorization.
11120101231020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185335020529 (or 185335020527 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11120101231020 its reverse (2013210102111), we get a palindrome (13133311333131).
The spelling of 11120101231020 in words is "eleven trillion, one hundred twenty billion, one hundred one million, two hundred thirty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •