Base | Representation |
---|---|
bin | 10000001011101111101… |
… | …001100110010111000100 |
3 | 10221022120201011110011200 |
4 | 100023233221212113010 |
5 | 121210111242101040 |
6 | 2210522450502500 |
7 | 143230265625465 |
oct | 20135751462704 |
9 | 3838521143150 |
10 | 1112122222020 |
11 | 3997150018a7 |
12 | 15b653594a30 |
13 | 80b46364204 |
14 | 3bb8141cd6c |
15 | 1ddded15630 |
hex | 102efa665c4 |
1112122222020 has 72 divisors (see below), whose sum is σ = 3374167130880. Its totient is φ = 296501774400.
The previous prime is 1112122221971. The next prime is 1112122222087. The reversal of 1112122222020 is 202222212111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1112122221984 and 1112122222002.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 169095 + ... + 1500945.
Almost surely, 21112122222020 is an apocalyptic number.
1112122222020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112122222020 is an abundant number, since it is smaller than the sum of its proper divisors (2262044908860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112122222020 is a wasteful number, since it uses less digits than its factorization.
1112122222020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1336505 (or 1336500 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1112122222020 its reverse (202222212111), we get a palindrome (1314344434131).
Subtracting from 1112122222020 its reverse (202222212111), we obtain a palindrome (909900009909).
The spelling of 1112122222020 in words is "one trillion, one hundred twelve billion, one hundred twenty-two million, two hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •