Base | Representation |
---|---|
bin | 1010001111100101010101… |
… | …1010100111110001000001 |
3 | 1110212201100111101112121112 |
4 | 2203321111122213301001 |
5 | 2434012242321321342 |
6 | 35542024230533105 |
7 | 2241466415252546 |
oct | 243712532476101 |
9 | 43781314345545 |
10 | 11262837292097 |
11 | 36525a7036776 |
12 | 131a991507195 |
13 | 639108c56771 |
14 | 2ad1a4c7abcd |
15 | 147e8b4d5682 |
hex | a3e556a7c41 |
11262837292097 has 2 divisors, whose sum is σ = 11262837292098. Its totient is φ = 11262837292096.
The previous prime is 11262837292043. The next prime is 11262837292099. The reversal of 11262837292097 is 79029273826211.
11262837292097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11245318387216 + 17518904881 = 3353404^2 + 132359^2 .
It is a cyclic number.
It is not a de Polignac number, because 11262837292097 - 216 = 11262837226561 is a prime.
Together with 11262837292099, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11262837292099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5631418646048 + 5631418646049.
It is an arithmetic number, because the mean of its divisors is an integer number (5631418646049).
Almost surely, 211262837292097 is an apocalyptic number.
It is an amenable number.
11262837292097 is a deficient number, since it is larger than the sum of its proper divisors (1).
11262837292097 is an equidigital number, since it uses as much as digits as its factorization.
11262837292097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9144576, while the sum is 59.
The spelling of 11262837292097 in words is "eleven trillion, two hundred sixty-two billion, eight hundred thirty-seven million, two hundred ninety-two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •