Base | Representation |
---|---|
bin | 1110001100011010110000… |
… | …11000101101100110110101 |
3 | 11002111221020100102011221110 |
4 | 13012031120120231212311 |
5 | 13042343221103311201 |
6 | 150215020421505233 |
7 | 6401031330155250 |
oct | 706153030554665 |
9 | 132457210364843 |
10 | 31213010213301 |
11 | 9a443aa5a8a44 |
12 | 3601359b72219 |
13 | 14554b3263607 |
14 | 79ca0973c097 |
15 | 391dc6c826d6 |
hex | 1c635862d9b5 |
31213010213301 has 32 divisors (see below), whose sum is σ = 48957131980800. Its totient is φ = 17319063396096.
The previous prime is 31213010213299. The next prime is 31213010213311. The reversal of 31213010213301 is 10331201031213.
It is a happy number.
It is not a de Polignac number, because 31213010213301 - 21 = 31213010213299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31213010213311) 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 31 ways as a sum of consecutive naturals, for example, 124379076 + ... + 124629773.
It is an arithmetic number, because the mean of its divisors is an integer number (1529910374400).
Almost surely, 231213010213301 is an apocalyptic number.
It is an amenable number.
31213010213301 is a deficient number, since it is larger than the sum of its proper divisors (17744121767499).
31213010213301 is a wasteful number, since it uses less digits than its factorization.
31213010213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249009033.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 31213010213301 its reverse (10331201031213), we get a palindrome (41544211244514).
The spelling of 31213010213301 in words is "thirty-one trillion, two hundred thirteen billion, ten million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •