Base | Representation |
---|---|
bin | 1110001001001100001110… |
… | …11110110110110010000011 |
3 | 11002010100000222222212101211 |
4 | 13010212013132312302003 |
5 | 13034034131042000303 |
6 | 150052042151510551 |
7 | 6360024543140164 |
oct | 704460736666203 |
9 | 132110028885354 |
10 | 31102131203203 |
11 | 9a01381262605 |
12 | 35a3974988457 |
13 | 1447bc290bbb8 |
14 | 7974cb90376b |
15 | 38e08790766d |
hex | 1c49877b6c83 |
31102131203203 has 4 divisors (see below), whose sum is σ = 31200245182080. Its totient is φ = 31004017224328.
The previous prime is 31102131203137. The next prime is 31102131203267. The reversal of 31102131203203 is 30230213120113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31102131203203 - 221 = 31102129106051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31102131203903) 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 3 ways as a sum of consecutive naturals, for example, 49056988963 + ... + 49056989596.
It is an arithmetic number, because the mean of its divisors is an integer number (7800061295520).
Almost surely, 231102131203203 is an apocalyptic number.
31102131203203 is a deficient number, since it is larger than the sum of its proper divisors (98113978877).
31102131203203 is an equidigital number, since it uses as much as digits as its factorization.
31102131203203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98113978876.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 31102131203203 its reverse (30230213120113), we get a palindrome (61332344323316).
The spelling of 31102131203203 in words is "thirty-one trillion, one hundred two billion, one hundred thirty-one million, two hundred three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •