Base | Representation |
---|---|
bin | 1001011000001100101000… |
… | …0011000100011000001101 |
3 | 1100111202022000101111010200 |
4 | 2112003022003010120031 |
5 | 2322420031143444042 |
6 | 33532541230524113 |
7 | 2112652623006054 |
oct | 226031203043015 |
9 | 40452260344120 |
10 | 10311311312397 |
11 | 3316003469787 |
12 | 11a6499366639 |
13 | 59a477540594 |
14 | 2790da61b39b |
15 | 12d34a686c4c |
hex | 960ca0c460d |
10311311312397 has 12 divisors (see below), whose sum is σ = 14899618450080. Its totient is φ = 6871668106248.
The previous prime is 10311311312389. The next prime is 10311311312411. The reversal of 10311311312397 is 79321311311301.
It is a happy number.
10311311312397 is a `hidden beast` number, since 1 + 0 + 3 + 1 + 131 + 131 + 2 + 397 = 666.
It is not a de Polignac number, because 10311311312397 - 23 = 10311311312389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10311311312317) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 211593897 + ... + 211642622.
It is an arithmetic number, because the mean of its divisors is an integer number (1241634870840).
Almost surely, 210311311312397 is an apocalyptic number.
It is an amenable number.
10311311312397 is a deficient number, since it is larger than the sum of its proper divisors (4588307137683).
10311311312397 is a wasteful number, since it uses less digits than its factorization.
10311311312397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423239232 (or 423239229 counting only the distinct ones).
The product of its (nonzero) digits is 10206, while the sum is 36.
Adding to 10311311312397 its reverse (79321311311301), we get a palindrome (89632622623698).
The spelling of 10311311312397 in words is "ten trillion, three hundred eleven billion, three hundred eleven million, three hundred twelve thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •