Base | Representation |
---|---|
bin | 1010010011000110100101… |
… | …1001100001110101100001 |
3 | 1111002111102101120122010202 |
4 | 2210301221121201311201 |
5 | 2441010110313422004 |
6 | 40025504141234545 |
7 | 2246036660500436 |
oct | 244615131416541 |
9 | 44074371518122 |
10 | 11323302092129 |
11 | 3676204918995 |
12 | 132a646b62a55 |
13 | 641a23a92c51 |
14 | 2b209d361b8d |
15 | 14982994bb1e |
hex | a4c69661d61 |
11323302092129 has 2 divisors, whose sum is σ = 11323302092130. Its totient is φ = 11323302092128.
The previous prime is 11323302092093. The next prime is 11323302092153. The reversal of 11323302092129 is 92129020332311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10130521391104 + 1192780701025 = 3182848^2 + 1092145^2 .
It is a cyclic number.
It is not a de Polignac number, because 11323302092129 - 28 = 11323302091873 is a prime.
It is a super-2 number, since 2×113233020921292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11323302092092 and 11323302092101.
It is not a weakly prime, because it can be changed into another prime (11323302092329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661651046064 + 5661651046065.
It is an arithmetic number, because the mean of its divisors is an integer number (5661651046065).
Almost surely, 211323302092129 is an apocalyptic number.
It is an amenable number.
11323302092129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323302092129 is an equidigital number, since it uses as much as digits as its factorization.
11323302092129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34992, while the sum is 38.
The spelling of 11323302092129 in words is "eleven trillion, three hundred twenty-three billion, three hundred two million, ninety-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •