Base | Representation |
---|---|
bin | 10100111110111011… |
… | …11101010010001011 |
3 | 1002002002202211202121 |
4 | 22133131331102023 |
5 | 141032413141011 |
6 | 5101503512111 |
7 | 546111011056 |
oct | 123735752213 |
9 | 32062684677 |
10 | 11265365131 |
11 | 4861006619 |
12 | 22248b8637 |
13 | 10a6bb9937 |
14 | 78c229a9d |
15 | 45e00ae71 |
hex | 29f77d48b |
11265365131 has 4 divisors (see below), whose sum is σ = 11374737712. Its totient is φ = 11155992552.
The previous prime is 11265365113. The next prime is 11265365149. The reversal of 11265365131 is 13156356211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13156356211 = 7001 ⋅1879211.
It is an interprime number because it is at equal distance from previous prime (11265365113) and next prime (11265365149).
It is a cyclic number.
It is not a de Polignac number, because 11265365131 - 213 = 11265356939 is a prime.
It is a super-4 number, since 4×112653651314 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11265365101) 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, 54686136 + ... + 54686341.
It is an arithmetic number, because the mean of its divisors is an integer number (2843684428).
Almost surely, 211265365131 is an apocalyptic number.
11265365131 is a deficient number, since it is larger than the sum of its proper divisors (109372581).
11265365131 is a wasteful number, since it uses less digits than its factorization.
11265365131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109372580.
The product of its digits is 16200, while the sum is 34.
The spelling of 11265365131 in words is "eleven billion, two hundred sixty-five million, three hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •