Base | Representation |
---|---|
bin | 11101101111101011101… |
… | …00000000011000011000 |
3 | 10121201001010012102122120 |
4 | 32313311310000120120 |
5 | 113221110003100440 |
6 | 2101303101421240 |
7 | 133560613466505 |
oct | 16676564003030 |
9 | 3551033172576 |
10 | 1022031300120 |
11 | 36449402a846 |
12 | 1460b026a820 |
13 | 754b97594bc |
14 | 376764144ac |
15 | 1b8ba9c8dd0 |
hex | edf5d00618 |
1022031300120 has 32 divisors (see below), whose sum is σ = 3066093900720. Its totient is φ = 272541680000.
The previous prime is 1022031300091. The next prime is 1022031300133. The reversal of 1022031300120 is 210031302201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1022031300120.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 4258463631 + ... + 4258463870.
Almost surely, 21022031300120 is an apocalyptic number.
1022031300120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022031300120 is an abundant number, since it is smaller than the sum of its proper divisors (2044062600600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022031300120 is a wasteful number, since it uses less digits than its factorization.
1022031300120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8516927515 (or 8516927511 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1022031300120 its reverse (210031302201), we get a palindrome (1232062602321).
The spelling of 1022031300120 in words is "one trillion, twenty-two billion, thirty-one million, three hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •