Base | Representation |
---|---|
bin | 1110001111100010010010… |
… | …01111000100100011011011 |
3 | 11002220011201201120211112000 |
4 | 13013301021033010203123 |
5 | 13101122111313210021 |
6 | 150340134051052043 |
7 | 6411543011131536 |
oct | 707611117044333 |
9 | 132804651524460 |
10 | 31320130210011 |
11 | 9a85879a97a45 |
12 | 361a0742a1023 |
13 | 1462624ba1556 |
14 | 7a3c8c233a1d |
15 | 394a960dab26 |
hex | 1c7c493c48db |
31320130210011 has 64 divisors (see below), whose sum is σ = 47046514007040. Its totient is φ = 20591484076800.
The previous prime is 31320130209989. The next prime is 31320130210021. The reversal of 31320130210011 is 11001203102313.
31320130210011 is a `hidden beast` number, since 3 + 1 + 320 + 130 + 210 + 0 + 1 + 1 = 666.
It is not a de Polignac number, because 31320130210011 - 26 = 31320130209947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31320130210021) 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 63 ways as a sum of consecutive naturals, for example, 744402471 + ... + 744444543.
It is an arithmetic number, because the mean of its divisors is an integer number (735101781360).
Almost surely, 231320130210011 is an apocalyptic number.
31320130210011 is a deficient number, since it is larger than the sum of its proper divisors (15726383797029).
31320130210011 is a wasteful number, since it uses less digits than its factorization.
31320130210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43553 (or 43547 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 31320130210011 its reverse (11001203102313), we get a palindrome (42321333312324).
The spelling of 31320130210011 in words is "thirty-one trillion, three hundred twenty billion, one hundred thirty million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •