Base | Representation |
---|---|
bin | 11001001111100011101000… |
… | …001011100101111101111100 |
3 | 112120002102120022200121102112 |
4 | 121033203220023211331330 |
5 | 104022423342231121340 |
6 | 1032041551433113152 |
7 | 32245642204562414 |
oct | 3117435013457574 |
9 | 476072508617375 |
10 | 111020210020220 |
11 | 324134522a1436 |
12 | 105505638587b8 |
13 | 49c42125c9a37 |
14 | 1d5b59a4dd644 |
15 | cc7d5537d065 |
hex | 64f8e82e5f7c |
111020210020220 has 48 divisors (see below), whose sum is σ = 236133290789760. Its totient is φ = 43838587293696.
The previous prime is 111020210020211. The next prime is 111020210020267. The reversal of 111020210020220 is 22020012020111.
It is a junction number, because it is equal to n+sod(n) for n = 111020210020195 and 111020210020204.
It is a congruent number.
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, 3504014 + ... + 15307466.
It is an arithmetic number, because the mean of its divisors is an integer number (4919443558120).
Almost surely, 2111020210020220 is an apocalyptic number.
111020210020220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111020210020220 is an abundant number, since it is smaller than the sum of its proper divisors (125113080769540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111020210020220 is a wasteful number, since it uses less digits than its factorization.
111020210020220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11809494 (or 11809492 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 111020210020220 its reverse (22020012020111), we get a palindrome (133040222040331).
The spelling of 111020210020220 in words is "one hundred eleven trillion, twenty billion, two hundred ten million, twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •