Base | Representation |
---|---|
bin | 101101100101111011100… |
… | …111001111011100000000 |
3 | 102002112002110220001120221 |
4 | 231211323213033130000 |
5 | 402313044342340300 |
6 | 10355154550312424 |
7 | 442234156312366 |
oct | 55457347173400 |
9 | 12075073801527 |
10 | 3133105043200 |
11 | aa8819131810 |
12 | 427272658714 |
13 | 1995b1aa70b2 |
14 | ab90090d636 |
15 | 56774e9a31a |
hex | 2d97b9cf700 |
3133105043200 has 432 divisors, whose sum is σ = 8868348389376. Its totient is φ = 1084763750400.
The previous prime is 3133105043153. The next prime is 3133105043209. The reversal of 3133105043200 is 23405013313.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3133105043209) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 361077262 + ... + 361085938.
Almost surely, 23133105043200 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 3133105043200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4434174194688).
3133105043200 is an abundant number, since it is smaller than the sum of its proper divisors (5735243346176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3133105043200 is a wasteful number, since it uses less digits than its factorization.
3133105043200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8960 (or 8941 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 25.
The spelling of 3133105043200 in words is "three trillion, one hundred thirty-three billion, one hundred five million, forty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •