Base | Representation |
---|---|
bin | 11100111000100001… |
… | …010100110110001111 |
3 | 2222001100111020002022 |
4 | 130320201110312033 |
5 | 1002003314000221 |
6 | 22125220520355 |
7 | 2145350262623 |
oct | 347041246617 |
9 | 88040436068 |
10 | 31013031311 |
11 | 12175058499 |
12 | 60162500bb |
13 | 2c03215802 |
14 | 1702bc9183 |
15 | c17a314ab |
hex | 738854d8f |
31013031311 has 4 divisors (see below), whose sum is σ = 31013433192. Its totient is φ = 31012629432.
The previous prime is 31013031281. The next prime is 31013031373. The reversal of 31013031311 is 11313031013.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31013031311 is a prime.
It is a super-2 number, since 2×310130313112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31013031311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31013030311) 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, 44681 + ... + 253026.
It is an arithmetic number, because the mean of its divisors is an integer number (7753358298).
Almost surely, 231013031311 is an apocalyptic number.
31013031311 is a deficient number, since it is larger than the sum of its proper divisors (401881).
31013031311 is a wasteful number, since it uses less digits than its factorization.
31013031311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401880.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 31013031311 its reverse (11313031013), we get a palindrome (42326062324).
The spelling of 31013031311 in words is "thirty-one billion, thirteen million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •