Base | Representation |
---|---|
bin | 11101000100010000… |
… | …101101101010011101 |
3 | 2222120002010102120210 |
4 | 131010100231222131 |
5 | 1002404230044401 |
6 | 22200534403033 |
7 | 2153261435454 |
oct | 350420555235 |
9 | 88502112523 |
10 | 31210003101 |
11 | 122662622a2 |
12 | 6070200479 |
13 | 2c34c7c674 |
14 | 172101db9b |
15 | c29e8d4d6 |
hex | 74442da9d |
31210003101 has 4 divisors (see below), whose sum is σ = 41613337472. Its totient is φ = 20806668732.
The previous prime is 31210003037. The next prime is 31210003103. The reversal of 31210003101 is 10130001213.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10130001213 = 3 ⋅3376667071.
It is not a de Polignac number, because 31210003101 - 26 = 31210003037 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 (31210003103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5201667181 + ... + 5201667186.
It is an arithmetic number, because the mean of its divisors is an integer number (10403334368).
Almost surely, 231210003101 is an apocalyptic number.
It is an amenable number.
31210003101 is a deficient number, since it is larger than the sum of its proper divisors (10403334371).
31210003101 is a wasteful number, since it uses less digits than its factorization.
31210003101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10403334370.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 31210003101 its reverse (10130001213), we get a palindrome (41340004314).
The spelling of 31210003101 in words is "thirty-one billion, two hundred ten million, three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •