Base | Representation |
---|---|
bin | 11101110000011001001… |
… | …01001110000111111100 |
3 | 10121202000202000001021102 |
4 | 32320030211032013330 |
5 | 113222400301101340 |
6 | 2101405025152232 |
7 | 133603232442434 |
oct | 16701445160774 |
9 | 3552022001242 |
10 | 1022413300220 |
11 | 36466a721104 |
12 | 14619818b678 |
13 | 7554a937b70 |
14 | 376b10512c4 |
15 | 1b8de2d4215 |
hex | ee0c94e1fc |
1022413300220 has 48 divisors (see below), whose sum is σ = 2313134902848. Its totient is φ = 377358220800.
The previous prime is 1022413300219. The next prime is 1022413300243. The reversal of 1022413300220 is 220033142201.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1022413300192 and 1022413300201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107489 + ... + 1434008.
It is an arithmetic number, because the mean of its divisors is an integer number (48190310476).
Almost surely, 21022413300220 is an apocalyptic number.
1022413300220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022413300220 is an abundant number, since it is smaller than the sum of its proper divisors (1290721602628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022413300220 is a wasteful number, since it uses less digits than its factorization.
1022413300220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544070 (or 1544068 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1022413300220 its reverse (220033142201), we get a palindrome (1242446442421).
The spelling of 1022413300220 in words is "one trillion, twenty-two billion, four hundred thirteen million, three hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •