Base | Representation |
---|---|
bin | 1110001100010101101110… |
… | …00010101111000000100101 |
3 | 11002111200020200220202112202 |
4 | 13012022313002233000211 |
5 | 13042322200122220401 |
6 | 150213452043424245 |
7 | 6400604261022323 |
oct | 706126702570045 |
9 | 132450220822482 |
10 | 31210303320101 |
11 | 9a43240634024 |
12 | 3600923525085 |
13 | 1455171505469 |
14 | 79c830032d13 |
15 | 391cb92da06b |
hex | 1c62b70af025 |
31210303320101 has 4 divisors (see below), whose sum is σ = 31229070792192. Its totient is φ = 31191535848012.
The previous prime is 31210303320089. The next prime is 31210303320137. The reversal of 31210303320101 is 10102330301213.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31210303320101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31210303320191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9383733551 + ... + 9383736876.
It is an arithmetic number, because the mean of its divisors is an integer number (7807267698048).
Almost surely, 231210303320101 is an apocalyptic number.
It is an amenable number.
31210303320101 is a deficient number, since it is larger than the sum of its proper divisors (18767472091).
31210303320101 is a wasteful number, since it uses less digits than its factorization.
31210303320101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18767472090.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 31210303320101 its reverse (10102330301213), we get a palindrome (41312633621314).
The spelling of 31210303320101 in words is "thirty-one trillion, two hundred ten billion, three hundred three million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •