Base | Representation |
---|---|
bin | 11001001111011100010001… |
… | …011000000110011010100000 |
3 | 112120001200011211201111101202 |
4 | 121033130101120012122200 |
5 | 104022311203133330422 |
6 | 1032034203550420332 |
7 | 32245242363144005 |
oct | 3117342130063240 |
9 | 476050154644352 |
10 | 111012311230112 |
11 | 32410069671526 |
12 | 1054ab1a5016a8 |
13 | 49c3554032036 |
14 | 1d5b04b45d8ac |
15 | cc7a41bc5b92 |
hex | 64f7116066a0 |
111012311230112 has 96 divisors (see below), whose sum is σ = 224860328017920. Its totient is φ = 53927493073920.
The previous prime is 111012311230049. The next prime is 111012311230123. The reversal of 111012311230112 is 211032113210111.
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, 829292978 + ... + 829426830.
It is an arithmetic number, because the mean of its divisors is an integer number (2342295083520).
Almost surely, 2111012311230112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111012311230112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112430164008960).
111012311230112 is an abundant number, since it is smaller than the sum of its proper divisors (113848016787808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111012311230112 is a wasteful number, since it uses less digits than its factorization.
111012311230112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139126 (or 139118 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 111012311230112 its reverse (211032113210111), we get a palindrome (322044424440223).
The spelling of 111012311230112 in words is "one hundred eleven trillion, twelve billion, three hundred eleven million, two hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •