Base | Representation |
---|---|
bin | 11101101011111100000… |
… | …11001011100011000100 |
3 | 10121111212002101000122202 |
4 | 32311332003023203010 |
5 | 113203001113341400 |
6 | 2100331443414032 |
7 | 133460045022110 |
oct | 16657603134304 |
9 | 3544762330582 |
10 | 1020022012100 |
11 | 363652919a33 |
12 | 14582b384318 |
13 | 752593ac690 |
14 | 3752561c740 |
15 | 1b7ee3ce4d5 |
hex | ed7e0cb8c4 |
1020022012100 has 144 divisors (see below), whose sum is σ = 2729292147456. Its totient is φ = 322221888000.
The previous prime is 1020022012057. The next prime is 1020022012109. The reversal of 1020022012100 is 12102200201.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (1020022012109) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4819505 + ... + 5026695.
Almost surely, 21020022012100 is an apocalyptic number.
1020022012100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1020022012100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1364646073728).
1020022012100 is an abundant number, since it is smaller than the sum of its proper divisors (1709270135356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020022012100 is a wasteful number, since it uses less digits than its factorization.
1020022012100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207766 (or 207759 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 1020022012100 its reverse (12102200201), we get a palindrome (1032124212301).
The spelling of 1020022012100 in words is "one trillion, twenty billion, twenty-two million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •