Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …000101111110000000100 |
3 | 10221012200111112210011201 |
4 | 100022230300233300010 |
5 | 121200312001201040 |
6 | 2210215242112244 |
7 | 143160421241410 |
oct | 20125460576004 |
9 | 3835614483151 |
10 | 1111000022020 |
11 | 399199604389 |
12 | 15b39b7ab684 |
13 | 809c7a0c945 |
14 | 3bab6381d40 |
15 | 1dd76546a9a |
hex | 102acc2fc04 |
1111000022020 has 48 divisors (see below), whose sum is σ = 2666878841088. Its totient is φ = 380845895040.
The previous prime is 1111000021993. The next prime is 1111000022029. The reversal of 1111000022020 is 202200001111.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 1111000021988 and 1111000022006.
It is not an unprimeable number, because it can be changed into a prime (1111000022029) 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, 73054 + ... + 1492426.
It is an arithmetic number, because the mean of its divisors is an integer number (55559975856).
Almost surely, 21111000022020 is an apocalyptic number.
1111000022020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111000022020 is an abundant number, since it is smaller than the sum of its proper divisors (1555878819068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111000022020 is a wasteful number, since it uses less digits than its factorization.
1111000022020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1424980 (or 1424978 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1111000022020 its reverse (202200001111), we get a palindrome (1313200023131).
The spelling of 1111000022020 in words is "one trillion, one hundred eleven billion, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •