Base | Representation |
---|---|
bin | 10101000100010100… |
… | …00000000001101011 |
3 | 1002012020122011022222 |
4 | 22202022000001223 |
5 | 141130434341011 |
6 | 5110154304255 |
7 | 550166240000 |
oct | 124212000153 |
9 | 32166564288 |
10 | 11310465131 |
11 | 488450a949 |
12 | 2237a2808b |
13 | 10b334a924 |
14 | 7942098a7 |
15 | 462e68ddb |
hex | 2a228006b |
11310465131 has 20 divisors (see below), whose sum is σ = 13649833200. Its totient is φ = 9360327312.
The previous prime is 11310465097. The next prime is 11310465149. The reversal of 11310465131 is 13156401311.
It is a happy number.
It is not a de Polignac number, because 11310465131 - 218 = 11310202987 is a prime.
It is a super-2 number, since 2×113104651312 (a number of 21 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 11310465131.
It is not an unprimeable number, because it can be changed into a prime (11310465161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 11591 + ... + 150848.
It is an arithmetic number, because the mean of its divisors is an integer number (682491660).
Almost surely, 211310465131 is an apocalyptic number.
11310465131 is a deficient number, since it is larger than the sum of its proper divisors (2339368069).
11310465131 is an frugal number, since it uses more digits than its factorization.
11310465131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162496 (or 162475 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 11310465131 its reverse (13156401311), we get a palindrome (24466866442).
The spelling of 11310465131 in words is "eleven billion, three hundred ten million, four hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •