Base | Representation |
---|---|
bin | 1010010011101000100010… |
… | …0001100101011101101101 |
3 | 1111010100221102200022201112 |
4 | 2210322020201211131231 |
5 | 2441132241020414204 |
6 | 40034012250121405 |
7 | 2246511534426233 |
oct | 244721041453555 |
9 | 44110842608645 |
10 | 11332414232429 |
11 | 367a060442854 |
12 | 133036a720265 |
13 | 642846847844 |
14 | 2b26c5608953 |
15 | 149bae8ca26e |
hex | a4e8886576d |
11332414232429 has 2 divisors, whose sum is σ = 11332414232430. Its totient is φ = 11332414232428.
The previous prime is 11332414232329. The next prime is 11332414232431. The reversal of 11332414232429 is 92423241423311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11314645875625 + 17768356804 = 3363725^2 + 133298^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11332414232429 is a prime.
It is a super-2 number, since 2×113324142324292 (a number of 27 digits) contains 22 as substring.
Together with 11332414232431, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11332414232459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5666207116214 + 5666207116215.
It is an arithmetic number, because the mean of its divisors is an integer number (5666207116215).
Almost surely, 211332414232429 is an apocalyptic number.
It is an amenable number.
11332414232429 is a deficient number, since it is larger than the sum of its proper divisors (1).
11332414232429 is an equidigital number, since it uses as much as digits as its factorization.
11332414232429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 248832, while the sum is 41.
The spelling of 11332414232429 in words is "eleven trillion, three hundred thirty-two billion, four hundred fourteen million, two hundred thirty-two thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •