Base | Representation |
---|---|
bin | 11001001111011100000101… |
… | …011001001110110011001010 |
3 | 112120001122122211110002221102 |
4 | 121033130011121032303022 |
5 | 104022310300202400020 |
6 | 1032034132005541402 |
7 | 32245234402336265 |
oct | 3117340531166312 |
9 | 476048584402842 |
10 | 111012110200010 |
11 | 3240aa76145648 |
12 | 1054aa83114862 |
13 | 49c35214a6c06 |
14 | 1d5b02c88dcdc |
15 | cc7a2e216475 |
hex | 64f70564ecca |
111012110200010 has 64 divisors (see below), whose sum is σ = 203885806924800. Its totient is φ = 43511003615232.
The previous prime is 111012110200009. The next prime is 111012110200049. The reversal of 111012110200010 is 10002011210111.
It is a super-2 number, since 2×1110121102000102 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111012110199964 and 111012110200000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 472356911 + ... + 472591869.
It is an arithmetic number, because the mean of its divisors is an integer number (3185715733200).
Almost surely, 2111012110200010 is an apocalyptic number.
111012110200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111012110200010 is a deficient number, since it is larger than the sum of its proper divisors (92873696724790).
111012110200010 is a wasteful number, since it uses less digits than its factorization.
111012110200010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239895.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111012110200010 its reverse (10002011210111), we get a palindrome (121014121410121).
The spelling of 111012110200010 in words is "one hundred eleven trillion, twelve billion, one hundred ten million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •