Base | Representation |
---|---|
bin | 1101101100011000011000… |
… | …01011010010111100000000 |
3 | 10221121200220101102102100102 |
4 | 12312030030023102330000 |
5 | 12421324311310000000 |
6 | 144013210215141532 |
7 | 6225351611554655 |
oct | 666141413227400 |
9 | 127550811372312 |
10 | 30112220000000 |
11 | 965a580191006 |
12 | 3463b496748a8 |
13 | 13a5754850c08 |
14 | 761621335c2c |
15 | 37344bc3e3d5 |
hex | 1b630c2d2f00 |
30112220000000 has 144 divisors (see below), whose sum is σ = 75133375236192. Its totient is φ = 12044880000000.
The previous prime is 30112219999993. The next prime is 30112220000053. The reversal of 30112220000000 is 2221103.
It is a happy number.
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 15 ways as a sum of consecutive naturals, for example, 19247195 + ... + 20752805.
Almost surely, 230112220000000 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 30112220000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37566687618096).
30112220000000 is an abundant number, since it is smaller than the sum of its proper divisors (45021155236192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30112220000000 is an frugal number, since it uses more digits than its factorization.
30112220000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1505662 (or 1505618 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 30112220000000 its reverse (2221103), we get a palindrome (30112222221103).
The spelling of 30112220000000 in words is "thirty trillion, one hundred twelve billion, two hundred twenty million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •