Base | Representation |
---|---|
bin | 1110001001001100011010… |
… | …11111011001110111100101 |
3 | 11002010100022000200101121210 |
4 | 13010212031133121313211 |
5 | 13034034332343311323 |
6 | 150052100152302033 |
7 | 6360030206033160 |
oct | 704461537316745 |
9 | 132110260611553 |
10 | 31102232010213 |
11 | 9a01423155391 |
12 | 35a39a26a1919 |
13 | 1447c0a775b10 |
14 | 7974db064ad7 |
15 | 38e0916bb293 |
hex | 1c498d7d9de5 |
31102232010213 has 32 divisors (see below), whose sum is σ = 51040157598976. Its totient is φ = 16405380914688.
The previous prime is 31102232010209. The next prime is 31102232010251. The reversal of 31102232010213 is 31201023220113.
It is not a de Polignac number, because 31102232010213 - 22 = 31102232010209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 31102232010213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31102232010203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24427731 + ... + 25669407.
It is an arithmetic number, because the mean of its divisors is an integer number (1595004924968).
Almost surely, 231102232010213 is an apocalyptic number.
It is an amenable number.
31102232010213 is a deficient number, since it is larger than the sum of its proper divisors (19937925588763).
31102232010213 is a wasteful number, since it uses less digits than its factorization.
31102232010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1333453.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 31102232010213 its reverse (31201023220113), we get a palindrome (62303255230326).
The spelling of 31102232010213 in words is "thirty-one trillion, one hundred two billion, two hundred thirty-two million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •