Base | Representation |
---|---|
bin | 1010011000001110011100… |
… | …1101000101000000101101 |
3 | 1111101220120221221110000101 |
4 | 2212003213031011000231 |
5 | 2443430331344302334 |
6 | 40134141233231101 |
7 | 2255303644316665 |
oct | 246034715050055 |
9 | 44356527843011 |
10 | 11411312103469 |
11 | 36aa568210053 |
12 | 1343709402491 |
13 | 64a10b534935 |
14 | 2b644bc4d1a5 |
15 | 14bc7b242214 |
hex | a60e734502d |
11411312103469 has 2 divisors, whose sum is σ = 11411312103470. Its totient is φ = 11411312103468.
The previous prime is 11411312103437. The next prime is 11411312103479. The reversal of 11411312103469 is 96430121311411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9443851417225 + 1967460686244 = 3073085^2 + 1402662^2 .
It is a cyclic number.
It is not a de Polignac number, because 11411312103469 - 25 = 11411312103437 is a prime.
It is a super-2 number, since 2×114113121034692 (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 (11411312103479) 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, 5705656051734 + 5705656051735.
It is an arithmetic number, because the mean of its divisors is an integer number (5705656051735).
Almost surely, 211411312103469 is an apocalyptic number.
It is an amenable number.
11411312103469 is a deficient number, since it is larger than the sum of its proper divisors (1).
11411312103469 is an equidigital number, since it uses as much as digits as its factorization.
11411312103469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 37.
The spelling of 11411312103469 in words is "eleven trillion, four hundred eleven billion, three hundred twelve million, one hundred three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •