Base | Representation |
---|---|
bin | 1010000000101010010001… |
… | …1100001001001001001101 |
3 | 1102222012121110210102010111 |
4 | 2200022210130021021031 |
5 | 2420312220023201021 |
6 | 35224144504040021 |
7 | 2214122315215156 |
oct | 240124434111115 |
9 | 42865543712114 |
10 | 11006465053261 |
11 | 35638a7648137 |
12 | 1299162a63011 |
13 | 61ab9c95a462 |
14 | 2a0a0404092d |
15 | 1414840558e1 |
hex | a02a470924d |
11006465053261 has 2 divisors, whose sum is σ = 11006465053262. Its totient is φ = 11006465053260.
The previous prime is 11006465053189. The next prime is 11006465053333. The reversal of 11006465053261 is 16235056460011.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (11006465053189) and next prime (11006465053333).
It can be written as a sum of positive squares in only one way, i.e., 8437897897636 + 2568567155625 = 2904806^2 + 1602675^2 .
It is a cyclic number.
It is not a de Polignac number, because 11006465053261 - 219 = 11006464528973 is a prime.
It is a super-2 number, since 2×110064650532612 (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 (11006465053361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503232526630 + 5503232526631.
It is an arithmetic number, because the mean of its divisors is an integer number (5503232526631).
Almost surely, 211006465053261 is an apocalyptic number.
It is an amenable number.
11006465053261 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006465053261 is an equidigital number, since it uses as much as digits as its factorization.
11006465053261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 129600, while the sum is 40.
The spelling of 11006465053261 in words is "eleven trillion, six billion, four hundred sixty-five million, fifty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •