Base | Representation |
---|---|
bin | 1010010101111110011110… |
… | …1110111001010000011001 |
3 | 1111021012211122222022120001 |
4 | 2211133213232321100121 |
5 | 2442312210030400203 |
6 | 40104310350533001 |
7 | 2252435162145601 |
oct | 245374756712031 |
9 | 44235748868501 |
10 | 11372666262553 |
11 | 3695136690852 |
12 | 1338122b07161 |
13 | 64658cba084b |
14 | 2b462345dc01 |
15 | 14ac6859791d |
hex | a57e7bb9419 |
11372666262553 has 2 divisors, whose sum is σ = 11372666262554. Its totient is φ = 11372666262552.
The previous prime is 11372666262509. The next prime is 11372666262557. The reversal of 11372666262553 is 35526266627311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7315878124944 + 4056788137609 = 2704788^2 + 2014147^2 .
It is a cyclic number.
It is not a de Polignac number, because 11372666262553 - 225 = 11372632708121 is a prime.
It is a super-2 number, since 2×113726662625532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11372666262494 and 11372666262503.
It is not a weakly prime, because it can be changed into another prime (11372666262557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5686333131276 + 5686333131277.
It is an arithmetic number, because the mean of its divisors is an integer number (5686333131277).
Almost surely, 211372666262553 is an apocalyptic number.
It is an amenable number.
11372666262553 is a deficient number, since it is larger than the sum of its proper divisors (1).
11372666262553 is an equidigital number, since it uses as much as digits as its factorization.
11372666262553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16329600, while the sum is 55.
The spelling of 11372666262553 in words is "eleven trillion, three hundred seventy-two billion, six hundred sixty-six million, two hundred sixty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •