Base | Representation |
---|---|
bin | 11101001010001110… |
… | …100101111000000101 |
3 | 2222211001111101201121 |
4 | 131022032211320011 |
5 | 1003110342011323 |
6 | 22214512153541 |
7 | 2155615355104 |
oct | 351216457005 |
9 | 88731441647 |
10 | 31310110213 |
11 | 12307817248 |
12 | 60998388b1 |
13 | 2c4c92cb45 |
14 | 173043c03b |
15 | c33b64a5d |
hex | 74a3a5e05 |
31310110213 has 8 divisors (see below), whose sum is σ = 33257803608. Its totient is φ = 29374185984.
The previous prime is 31310110129. The next prime is 31310110231. The reversal of 31310110213 is 31201101313.
It can be written as a sum of positive squares in 4 ways, for example, as 120077764 + 31190032449 = 10958^2 + 176607^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31310110213 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 (31310110283) 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 7 ways as a sum of consecutive naturals, for example, 2936806 + ... + 2947447.
It is an arithmetic number, because the mean of its divisors is an integer number (4157225451).
Almost surely, 231310110213 is an apocalyptic number.
It is an amenable number.
31310110213 is a deficient number, since it is larger than the sum of its proper divisors (1947693395).
31310110213 is a wasteful number, since it uses less digits than its factorization.
31310110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5884583.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 31310110213 its reverse (31201101313), we get a palindrome (62511211526).
The spelling of 31310110213 in words is "thirty-one billion, three hundred ten million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •