Base | Representation |
---|---|
bin | 101111000001010010101… |
… | …101101111101101011000 |
3 | 102102220022002202012200102 |
4 | 233001102231233231120 |
5 | 410420001000131300 |
6 | 10512221052554532 |
7 | 452306140303133 |
oct | 57012255575530 |
9 | 12386262665612 |
10 | 3231203130200 |
11 | 1036388a25491 |
12 | 44228b482a48 |
13 | 1a5916563316 |
14 | b256912921a |
15 | 590b724a0d5 |
hex | 2f052b6fb58 |
3231203130200 has 48 divisors (see below), whose sum is σ = 7586928981360. Its totient is φ = 1279684400000.
The previous prime is 3231203130187. The next prime is 3231203130289. The reversal of 3231203130200 is 20313021323.
It is a super-2 number, since 2×32312031302002 (a number of 26 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 79960076 + ... + 80000475.
It is an arithmetic number, because the mean of its divisors is an integer number (158061020445).
Almost surely, 23231203130200 is an apocalyptic number.
It is an amenable number.
3231203130200 is an abundant number, since it is smaller than the sum of its proper divisors (4355725851160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3231203130200 is a wasteful number, since it uses less digits than its factorization.
3231203130200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159960668 (or 159960659 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 3231203130200 its reverse (20313021323), we get a palindrome (3251516151523).
The spelling of 3231203130200 in words is "three trillion, two hundred thirty-one billion, two hundred three million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •