Base | Representation |
---|---|
bin | 1101101111000000000010… |
… | …10100001101010010100000 |
3 | 10221221022020111001212112220 |
4 | 12313200001110031102200 |
5 | 12424313132404200000 |
6 | 144122414110551040 |
7 | 6235016316025332 |
oct | 667400124152240 |
9 | 127838214055486 |
10 | 30202232100000 |
11 | 9694770716aa4 |
12 | 347948a508480 |
13 | 13b109b01b84c |
14 | 765b1daa3452 |
15 | 3759691ab1a0 |
hex | 1b780150d4a0 |
30202232100000 has 144 divisors (see below), whose sum is σ = 99094732593696. Its totient is φ = 8053928480000.
The previous prime is 30202232099999. The next prime is 30202232100011. The reversal of 30202232100000 is 123220203.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 50037054 + ... + 50637053.
It is an arithmetic number, because the mean of its divisors is an integer number (688157865234).
Almost surely, 230202232100000 is an apocalyptic number.
30202232100000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30202232100000 is an abundant number, since it is smaller than the sum of its proper divisors (68892500493696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30202232100000 is an equidigital number, since it uses as much as digits as its factorization.
30202232100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100674145 (or 100674117 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 30202232100000 its reverse (123220203), we get a palindrome (30202355320203).
The spelling of 30202232100000 in words is "thirty trillion, two hundred two billion, two hundred thirty-two million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •