Base | Representation |
---|---|
bin | 11101101100000101011… |
… | …01100001110100001100 |
3 | 10121112001112112111202212 |
4 | 32312002231201310030 |
5 | 113203131124102340 |
6 | 2100343320005552 |
7 | 133462014552002 |
oct | 16660255416414 |
9 | 3545045474685 |
10 | 1020100222220 |
11 | 363692a883a2 |
12 | 1458516008b8 |
13 | 7526c664161 |
14 | 37531b7aa72 |
15 | 1b8061cca65 |
hex | ed82b61d0c |
1020100222220 has 48 divisors (see below), whose sum is σ = 2256127776000. Its totient is φ = 386363828160.
The previous prime is 1020100222213. The next prime is 1020100222241. The reversal of 1020100222220 is 222220010201.
It is a junction number, because it is equal to n+sod(n) for n = 1020100222195 and 1020100222204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38681 + ... + 1428879.
It is an arithmetic number, because the mean of its divisors is an integer number (47002662000).
Almost surely, 21020100222220 is an apocalyptic number.
1020100222220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020100222220 is an abundant number, since it is smaller than the sum of its proper divisors (1236027553780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020100222220 is a wasteful number, since it uses less digits than its factorization.
1020100222220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1392158 (or 1392156 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 1020100222220 its reverse (222220010201), we get a palindrome (1242320232421).
The spelling of 1020100222220 in words is "one trillion, twenty billion, one hundred million, two hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •