Base | Representation |
---|---|
bin | 1110001100010101100111… |
… | …00001001101101011111101 |
3 | 11002111200002120200012200022 |
4 | 13012022303201031223331 |
5 | 13042322040003414323 |
6 | 150213442132341525 |
7 | 6400602642355130 |
oct | 706126341155375 |
9 | 132450076605608 |
10 | 31210244201213 |
11 | 9a43210225140 |
12 | 36009077748a5 |
13 | 14551621a657c |
14 | 79c826244217 |
15 | 391cb400d4c8 |
hex | 1c62b384dafd |
31210244201213 has 8 divisors (see below), whose sum is σ = 38911473289920. Its totient is φ = 24319670806080.
The previous prime is 31210244201197. The next prime is 31210244201237.
It is a happy number.
31210244201213 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31210244201213 - 24 = 31210244201197 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31210244201273) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202663923308 + ... + 202663923461.
It is an arithmetic number, because the mean of its divisors is an integer number (4863934161240).
Almost surely, 231210244201213 is an apocalyptic number.
It is an amenable number.
31210244201213 is a deficient number, since it is larger than the sum of its proper divisors (7701229088707).
31210244201213 is a wasteful number, since it uses less digits than its factorization.
31210244201213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405327846787.
The product of its (nonzero) digits is 2304, while the sum is 26.
It can be divided in two parts, 3121024 and 4201213, that added together give a palindrome (7322237).
The spelling of 31210244201213 in words is "thirty-one trillion, two hundred ten billion, two hundred forty-four million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •