Base | Representation |
---|---|
bin | 11001010001001010111001… |
… | …110011001010010000100110 |
3 | 112120111000210111122201011022 |
4 | 121101022321303022100212 |
5 | 104031232443324404110 |
6 | 1032204531212011142 |
7 | 32256646165505510 |
oct | 3121127163122046 |
9 | 476430714581138 |
10 | 111131101013030 |
11 | 3245648738163a |
12 | 10569b50a60ab2 |
13 | 4a01805588607 |
14 | 1d62ab9b76bb0 |
15 | ccab957c3755 |
hex | 6512b9cca426 |
111131101013030 has 16 divisors (see below), whose sum is σ = 228612550655520. Its totient is φ = 38102091775872.
The previous prime is 111131101013021. The next prime is 111131101013057. The reversal of 111131101013030 is 30310101131111.
It is a super-2 number, since 2×1111311010130302 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
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, 793793578595 + ... + 793793578734.
It is an arithmetic number, because the mean of its divisors is an integer number (14288284415970).
Almost surely, 2111131101013030 is an apocalyptic number.
111131101013030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111131101013030 is an abundant number, since it is smaller than the sum of its proper divisors (117481449642490).
111131101013030 is a wasteful number, since it uses less digits than its factorization.
111131101013030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1587587157343.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 111131101013030 its reverse (30310101131111), we get a palindrome (141441202144141).
The spelling of 111131101013030 in words is "one hundred eleven trillion, one hundred thirty-one billion, one hundred one million, thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •