Base | Representation |
---|---|
bin | 11100111000000000… |
… | …011001100111110001 |
3 | 2222000202020201022022 |
4 | 130320000121213301 |
5 | 1001444111300423 |
6 | 22124311521225 |
7 | 2145214024031 |
oct | 347000314761 |
9 | 88022221268 |
10 | 31004400113 |
11 | 121701a2775 |
12 | 6013389215 |
13 | 2c014b2cab |
14 | 17019bd8c1 |
15 | c16dc8dc8 |
hex | 7380199f1 |
31004400113 has 4 divisors (see below), whose sum is σ = 31529898480. Its totient is φ = 30478901748.
The previous prime is 31004400107. The next prime is 31004400179. The reversal of 31004400113 is 31100440013.
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.
It is a cyclic number.
It is not a de Polignac number, because 31004400113 - 28 = 31004399857 is a prime.
It is a super-2 number, since 2×310044001132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31004400091 and 31004400100.
It is not an unprimeable number, because it can be changed into a prime (31004406113) 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, 262749095 + ... + 262749212.
It is an arithmetic number, because the mean of its divisors is an integer number (7882474620).
Almost surely, 231004400113 is an apocalyptic number.
It is an amenable number.
31004400113 is a deficient number, since it is larger than the sum of its proper divisors (525498367).
31004400113 is an equidigital number, since it uses as much as digits as its factorization.
31004400113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 525498366.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 31004400113 its reverse (31100440013), we get a palindrome (62104840126).
The spelling of 31004400113 in words is "thirty-one billion, four million, four hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •