Base | Representation |
---|---|
bin | 1010011010001110011010… |
… | …1001010001101010110001 |
3 | 1111112012020220012011211201 |
4 | 2212203212221101222301 |
5 | 3000011204042101442 |
6 | 40202021552411201 |
7 | 2260631120436553 |
oct | 246434651215261 |
9 | 44465226164751 |
10 | 11445662456497 |
11 | 3713095083765 |
12 | 134a2b5246b01 |
13 | 650423c99209 |
14 | 2b7d89d6b4d3 |
15 | 14cadbc497b7 |
hex | a68e6a51ab1 |
11445662456497 has 2 divisors, whose sum is σ = 11445662456498. Its totient is φ = 11445662456496.
The previous prime is 11445662456491. The next prime is 11445662456519. The reversal of 11445662456497 is 79465426654411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6051358922401 + 5394303534096 = 2459951^2 + 2322564^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11445662456497 is a prime.
It is a super-2 number, since 2×114456624564972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11445662456491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5722831228248 + 5722831228249.
It is an arithmetic number, because the mean of its divisors is an integer number (5722831228249).
Almost surely, 211445662456497 is an apocalyptic number.
It is an amenable number.
11445662456497 is a deficient number, since it is larger than the sum of its proper divisors (1).
11445662456497 is an equidigital number, since it uses as much as digits as its factorization.
11445662456497 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 174182400, while the sum is 64.
It can be divided in two parts, 1144566 and 2456497, that added together give a palindrome (3601063).
The spelling of 11445662456497 in words is "eleven trillion, four hundred forty-five billion, six hundred sixty-two million, four hundred fifty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •