Base | Representation |
---|---|
bin | 11100110111111000… |
… | …000010111101000001 |
3 | 2222000121010110012012 |
4 | 130313320002331001 |
5 | 1001443031210423 |
6 | 22124152542305 |
7 | 2145156303140 |
oct | 346770027501 |
9 | 88017113165 |
10 | 31002210113 |
11 | 12169a37356 |
12 | 60126b1995 |
13 | 2c00bc7234 |
14 | 17015ad757 |
15 | c16ae5078 |
hex | 737e02f41 |
31002210113 has 4 divisors (see below), whose sum is σ = 35431097280. Its totient is φ = 26573322948.
The previous prime is 31002210101. The next prime is 31002210119. The reversal of 31002210113 is 31101220013.
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: 31101220013 = 2801 ⋅11103613.
It is a cyclic number.
It is not a de Polignac number, because 31002210113 - 24 = 31002210097 is a prime.
It is a super-2 number, since 2×310022101132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31002210119) 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, 2214443573 + ... + 2214443586.
It is an arithmetic number, because the mean of its divisors is an integer number (8857774320).
Almost surely, 231002210113 is an apocalyptic number.
It is an amenable number.
31002210113 is a deficient number, since it is larger than the sum of its proper divisors (4428887167).
31002210113 is an equidigital number, since it uses as much as digits as its factorization.
31002210113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4428887166.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 31002210113 its reverse (31101220013), we get a palindrome (62103430126).
The spelling of 31002210113 in words is "thirty-one billion, two million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •