Base | Representation |
---|---|
bin | 11101001001101111… |
… | …110111010100100000 |
3 | 2222210111100011022210 |
4 | 131021233313110200 |
5 | 1003101311231300 |
6 | 22214023402120 |
7 | 2155460036103 |
oct | 351157672440 |
9 | 88714304283 |
10 | 31302055200 |
11 | 12303215409 |
12 | 6096bb3340 |
13 | 2c4b06c670 |
14 | 172d34273a |
15 | c330c3050 |
hex | 749bf7520 |
31302055200 has 288 divisors, whose sum is σ = 110867654016. Its totient is φ = 7624949760.
The previous prime is 31302055181. The next prime is 31302055217. The reversal of 31302055200 is 255020313.
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 47 ways as a sum of consecutive naturals, for example, 3021229 + ... + 3031571.
It is an arithmetic number, because the mean of its divisors is an integer number (384957132).
Almost surely, 231302055200 is an apocalyptic number.
31302055200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31302055200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55433827008).
31302055200 is an abundant number, since it is smaller than the sum of its proper divisors (79565598816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31302055200 is a wasteful number, since it uses less digits than its factorization.
31302055200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10476 (or 10463 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 21.
Adding to 31302055200 its reverse (255020313), we get a palindrome (31557075513).
The spelling of 31302055200 in words is "thirty-one billion, three hundred two million, fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •