Base | Representation |
---|---|
bin | 101101001000111110110… |
… | …011010011010000000100 |
3 | 101222112212002221102201121 |
4 | 231020332303103100010 |
5 | 401310414111221200 |
6 | 10333014234403324 |
7 | 440053643101252 |
oct | 55107663232004 |
9 | 11875762842647 |
10 | 3102020023300 |
11 | a96617485220 |
12 | 421238290544 |
13 | 1966999a78b3 |
14 | aa1d23455d2 |
15 | 55a55e98e1a |
hex | 2d23ecd3404 |
3102020023300 has 144 divisors (see below), whose sum is σ = 7609107985920. Its totient is φ = 1087309440000.
The previous prime is 3102020023279. The next prime is 3102020023351. The reversal of 3102020023300 is 33200202013.
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 47 ways as a sum of consecutive naturals, for example, 19283200 + ... + 19443400.
It is an arithmetic number, because the mean of its divisors is an integer number (52841027680).
Almost surely, 23102020023300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3102020023300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3804553992960).
3102020023300 is an abundant number, since it is smaller than the sum of its proper divisors (4507087962620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3102020023300 is a wasteful number, since it uses less digits than its factorization.
3102020023300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160862 (or 160855 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 3102020023300 its reverse (33200202013), we get a palindrome (3135220225313).
The spelling of 3102020023300 in words is "three trillion, one hundred two billion, twenty million, twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •