Base | Representation |
---|---|
bin | 10101000101110101… |
… | …01000110100011011 |
3 | 1002020010121221001012 |
4 | 22202322220310123 |
5 | 141142220341011 |
6 | 5111331444135 |
7 | 550412512004 |
oct | 124272506433 |
9 | 32203557035 |
10 | 11323215131 |
11 | 4890729138 |
12 | 224015664b |
13 | 10b5b930c7 |
14 | 795ba81ab |
15 | 464136a8b |
hex | 2a2ea8d1b |
11323215131 has 2 divisors, whose sum is σ = 11323215132. Its totient is φ = 11323215130.
The previous prime is 11323215107. The next prime is 11323215151. The reversal of 11323215131 is 13151232311.
11323215131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11323215131 - 218 = 11322952987 is a prime.
It is a super-2 number, since 2×113232151312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11323215097 and 11323215106.
It is not a weakly prime, because it can be changed into another prime (11323215151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661607565 + 5661607566.
It is an arithmetic number, because the mean of its divisors is an integer number (5661607566).
Almost surely, 211323215131 is an apocalyptic number.
11323215131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323215131 is an equidigital number, since it uses as much as digits as its factorization.
11323215131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 540, while the sum is 23.
Adding to 11323215131 its reverse (13151232311), we get a palindrome (24474447442).
The spelling of 11323215131 in words is "eleven billion, three hundred twenty-three million, two hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •