Base | Representation |
---|---|
bin | 11001001111100011100001… |
… | …101000101111110100001101 |
3 | 112120002102021200002021212222 |
4 | 121033203201220233310031 |
5 | 104022423131124102341 |
6 | 1032041532511505125 |
7 | 32245636402401551 |
oct | 3117434150576415 |
9 | 476072250067788 |
10 | 111020100222221 |
11 | 324133a6318593 |
12 | 10550532b281a5 |
13 | 49c41c59355c8 |
14 | 1d5b589abb861 |
15 | cc7d4a8e044b |
hex | 64f8e1a2fd0d |
111020100222221 has 32 divisors (see below), whose sum is σ = 117261702770688. Its totient is φ = 104900598190080.
The previous prime is 111020100222173. The next prime is 111020100222233. The reversal of 111020100222221 is 122222001020111.
It is a cyclic number.
It is not a de Polignac number, because 111020100222221 - 222 = 111020096027917 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111020100222221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111020100212221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6911534036 + ... + 6911550098.
It is an arithmetic number, because the mean of its divisors is an integer number (3664428211584).
Almost surely, 2111020100222221 is an apocalyptic number.
It is an amenable number.
111020100222221 is a deficient number, since it is larger than the sum of its proper divisors (6241602548467).
111020100222221 is a wasteful number, since it uses less digits than its factorization.
111020100222221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21821.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 111020100222221 its reverse (122222001020111), we get a palindrome (233242101242332).
The spelling of 111020100222221 in words is "one hundred eleven trillion, twenty billion, one hundred million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •