Base | Representation |
---|---|
bin | 101011110101010101111… |
… | …001111001000111010000 |
3 | 101122222001022202220121002 |
4 | 223311111321321013100 |
5 | 343323003102022000 |
6 | 10223443001121132 |
7 | 430424311466402 |
oct | 53652571710720 |
9 | 11588038686532 |
10 | 3012213314000 |
11 | a61521984310 |
12 | 4079541891a8 |
13 | 18b086c30b17 |
14 | a5b12da0b72 |
15 | 5354ba9d8d5 |
hex | 2bd55e791d0 |
3012213314000 has 320 divisors, whose sum is σ = 7992661008384. Its totient is φ = 1088897600000.
The previous prime is 3012213313999. The next prime is 3012213314053. The reversal of 3012213314000 is 4133122103.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4655661677 + ... + 4655662323.
Almost surely, 23012213314000 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 3012213314000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3996330504192).
3012213314000 is an abundant number, since it is smaller than the sum of its proper divisors (4980447694384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3012213314000 is a wasteful number, since it uses less digits than its factorization.
3012213314000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1603 (or 1587 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 3012213314000 its reverse (4133122103), we get a palindrome (3016346436103).
The spelling of 3012213314000 in words is "three trillion, twelve billion, two hundred thirteen million, three hundred fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •