Base | Representation |
---|---|
bin | 1110001111100010010001… |
… | …10100110000000001111000 |
3 | 11002220011201020121021202110 |
4 | 13013301020310300001320 |
5 | 13101122103031411300 |
6 | 150340133243132320 |
7 | 6411542565363504 |
oct | 707611064600170 |
9 | 132804636537673 |
10 | 31320123310200 |
11 | 9a8587610501a |
12 | 361a071b140a0 |
13 | 1462623626b1a |
14 | 7a3c8b359304 |
15 | 394a956c6550 |
hex | 1c7c48d30078 |
31320123310200 has 48 divisors (see below), whose sum is σ = 97092382263480. Its totient is φ = 8352032882560.
The previous prime is 31320123310199. The next prime is 31320123310219. The reversal of 31320123310200 is 201332102313.
It is a super-2 number, since 2×313201233102002 (a number of 28 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 26100102159 + ... + 26100103358.
Almost surely, 231320123310200 is an apocalyptic number.
31320123310200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
31320123310200 is an abundant number, since it is smaller than the sum of its proper divisors (65772258953280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31320123310200 is a wasteful number, since it uses less digits than its factorization.
31320123310200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52200205536 (or 52200205527 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31320123310200 its reverse (201332102313), we get a palindrome (31521455412513).
The spelling of 31320123310200 in words is "thirty-one trillion, three hundred twenty billion, one hundred twenty-three million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •