Base | Representation |
---|---|
bin | 11001010010011111100100… |
… | …111111100111000000100100 |
3 | 112120210201110210210022011012 |
4 | 121102133210333213000210 |
5 | 104034230144110310040 |
6 | 1032314405101401352 |
7 | 32266345224311543 |
oct | 3122374477470044 |
9 | 476721423708135 |
10 | 111222020010020 |
11 | 32490aa281a777 |
12 | 105836a5569258 |
13 | 4a0a2648c5c9a |
14 | 1d67262b3815a |
15 | ccd217680865 |
hex | 6527e4fe7024 |
111222020010020 has 24 divisors (see below), whose sum is σ = 238535736534144. Its totient is φ = 43542237620576.
The previous prime is 111222020009983. The next prime is 111222020010041. The reversal of 111222020010020 is 20010020222111.
It is a junction number, because it is equal to n+sod(n) for n = 111222020009977 and 111222020010004.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59160648002 + ... + 59160649881.
It is an arithmetic number, because the mean of its divisors is an integer number (9938989022256).
Almost surely, 2111222020010020 is an apocalyptic number.
111222020010020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111222020010020 is an abundant number, since it is smaller than the sum of its proper divisors (127313716524124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111222020010020 is a wasteful number, since it uses less digits than its factorization.
111222020010020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118321297939 (or 118321297937 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 111222020010020 its reverse (20010020222111), we get a palindrome (131232040232131).
The spelling of 111222020010020 in words is "one hundred eleven trillion, two hundred twenty-two billion, twenty million, ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •