Base | Representation |
---|---|
bin | 10101000011010101… |
… | …00000101001010011 |
3 | 1002011200002202121020 |
4 | 22201222200221103 |
5 | 141121331211011 |
6 | 5105301330523 |
7 | 550036125642 |
oct | 124152405123 |
9 | 32150082536 |
10 | 11302210131 |
11 | 487a891833 |
12 | 2235106a43 |
13 | 10b171a404 |
14 | 79309b359 |
15 | 462388006 |
hex | 2a1aa0a53 |
11302210131 has 4 divisors (see below), whose sum is σ = 15069613512. Its totient is φ = 7534806752.
The previous prime is 11302210093. The next prime is 11302210141. The reversal of 11302210131 is 13101220311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13101220311 = 3 ⋅4367073437.
It is a cyclic number.
It is not a de Polignac number, because 11302210131 - 26 = 11302210067 is a prime.
It is a super-2 number, since 2×113022101312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11302210131.
It is not an unprimeable number, because it can be changed into a prime (11302210141) 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, 1883701686 + ... + 1883701691.
It is an arithmetic number, because the mean of its divisors is an integer number (3767403378).
Almost surely, 211302210131 is an apocalyptic number.
11302210131 is a deficient number, since it is larger than the sum of its proper divisors (3767403381).
11302210131 is an equidigital number, since it uses as much as digits as its factorization.
11302210131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3767403380.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11302210131 its reverse (13101220311), we get a palindrome (24403430442).
The spelling of 11302210131 in words is "eleven billion, three hundred two million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •