Base | Representation |
---|---|
bin | 11101101100010001011… |
… | …10000000101111111100 |
3 | 10121112022120012011122211 |
4 | 32312020232000233330 |
5 | 113203332424342340 |
6 | 2100401320150204 |
7 | 133464350344255 |
oct | 16661056005774 |
9 | 3545276164584 |
10 | 1020201012220 |
11 | 363734969415 |
12 | 14587b308364 |
13 | 752874c3400 |
14 | 375412d5b2c |
15 | 1b80ee8b5ea |
hex | ed88b80bfc |
1020201012220 has 72 divisors (see below), whose sum is σ = 2359221696720. Its totient is φ = 370304962560.
The previous prime is 1020201012217. The next prime is 1020201012241. The reversal of 1020201012220 is 222101020201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a self number, because there is not a number n which added to its sum of digits gives 1020201012220.
It is a congruent number.
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, 2358501 + ... + 2757340.
It is an arithmetic number, because the mean of its divisors is an integer number (32766968010).
Almost surely, 21020201012220 is an apocalyptic number.
1020201012220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020201012220 is an abundant number, since it is smaller than the sum of its proper divisors (1339020684500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020201012220 is a wasteful number, since it uses less digits than its factorization.
1020201012220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5115935 (or 5115920 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1020201012220 its reverse (222101020201), we get a palindrome (1242302032421).
The spelling of 1020201012220 in words is "one trillion, twenty billion, two hundred one million, twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •