Base | Representation |
---|---|
bin | 101011110100010100010… |
… | …001100101110001110000 |
3 | 101122212012120220001022012 |
4 | 223310110101211301300 |
5 | 343313224212330000 |
6 | 10223141425102052 |
7 | 430355111440100 |
oct | 53642421456160 |
9 | 11585176801265 |
10 | 3011112230000 |
11 | a61007399636 |
12 | 4076a7487928 |
13 | 18ac3ca90924 |
14 | a5a4aa5d200 |
15 | 534d50a1735 |
hex | 2bd14465c70 |
3011112230000 has 300 divisors, whose sum is σ = 8513795050992. Its totient is φ = 1028321280000.
The previous prime is 3011112229999. The next prime is 3011112230023. The reversal of 3011112230000 is 322111103.
It is a Harshad number since it is a multiple of its sum of digits (14).
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 59 ways as a sum of consecutive naturals, for example, 125918045 + ... + 125941955.
Almost surely, 23011112230000 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 3011112230000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4256897525496).
3011112230000 is an abundant number, since it is smaller than the sum of its proper divisors (5502682820992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3011112230000 is a wasteful number, since it uses less digits than its factorization.
3011112230000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24210 (or 24182 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 3011112230000 its reverse (322111103), we get a palindrome (3011434341103).
The spelling of 3011112230000 in words is "three trillion, eleven billion, one hundred twelve million, two hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •