Base | Representation |
---|---|
bin | 1010001101110010101010… |
… | …0110000100010100010101 |
3 | 1110202202220011101102101201 |
4 | 2203130222212010110111 |
5 | 2433011221322220034 |
6 | 35515533500152501 |
7 | 2236326525406531 |
oct | 243345246042425 |
9 | 43682804342351 |
10 | 11232054101269 |
11 | 364053a7a28a1 |
12 | 1314a20238731 |
13 | 636241545751 |
14 | 2ab8c4800bc1 |
15 | 147288c55014 |
hex | a372a984515 |
11232054101269 has 2 divisors, whose sum is σ = 11232054101270. Its totient is φ = 11232054101268.
The previous prime is 11232054101197. The next prime is 11232054101299. The reversal of 11232054101269 is 96210145023211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7376085651025 + 3855968450244 = 2715895^2 + 1963662^2 .
It is a cyclic number.
It is not a de Polignac number, because 11232054101269 - 217 = 11232053970197 is a prime.
It is a super-2 number, since 2×112320541012692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11232054101299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5616027050634 + 5616027050635.
It is an arithmetic number, because the mean of its divisors is an integer number (5616027050635).
Almost surely, 211232054101269 is an apocalyptic number.
It is an amenable number.
11232054101269 is a deficient number, since it is larger than the sum of its proper divisors (1).
11232054101269 is an equidigital number, since it uses as much as digits as its factorization.
11232054101269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 11232054101269 in words is "eleven trillion, two hundred thirty-two billion, fifty-four million, one hundred one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •