Base | Representation |
---|---|
bin | 11001010010010110010000… |
… | …011110001010010100011101 |
3 | 112120202202122022222210011222 |
4 | 121102112100132022110131 |
5 | 104034044200034133041 |
6 | 1032310032031423125 |
7 | 32265542221644212 |
oct | 3122262036122435 |
9 | 476682568883158 |
10 | 111212012021021 |
11 | 3248782754948a |
12 | 10581771984aa5 |
13 | 4a0932b36c3c2 |
14 | 1d669938d5b09 |
15 | cccd2dc4574b |
hex | 65259078a51d |
111212012021021 has 16 divisors (see below), whose sum is σ = 112074732177408. Its totient is φ = 110352049315200.
The previous prime is 111212012020997. The next prime is 111212012021023. The reversal of 111212012021021 is 120120210212111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111212012021021 is a prime.
It is a super-2 number, since 2×1112120120210212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111212012021023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1962386516 + ... + 1962443186.
It is an arithmetic number, because the mean of its divisors is an integer number (7004670761088).
Almost surely, 2111212012021021 is an apocalyptic number.
It is an amenable number.
111212012021021 is a deficient number, since it is larger than the sum of its proper divisors (862720156387).
111212012021021 is a wasteful number, since it uses less digits than its factorization.
111212012021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80732.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111212012021021 its reverse (120120210212111), we get a palindrome (231332222233132).
The spelling of 111212012021021 in words is "one hundred eleven trillion, two hundred twelve billion, twelve million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •