Base | Representation |
---|---|
bin | 1010001011111111110000… |
… | …1001100101100001100001 |
3 | 1110122211021120222102112101 |
4 | 2202333330021211201201 |
5 | 2432010034242041342 |
6 | 35453433114330401 |
7 | 2234155300003045 |
oct | 242777411454141 |
9 | 43584246872471 |
10 | 11201210112097 |
11 | 3629452103255 |
12 | 130aa52729a01 |
13 | 633367368295 |
14 | 2aa1da25a025 |
15 | 146580eb53b7 |
hex | a2ffc265861 |
11201210112097 has 2 divisors, whose sum is σ = 11201210112098. Its totient is φ = 11201210112096.
The previous prime is 11201210112083. The next prime is 11201210112133. The reversal of 11201210112097 is 79021101210211.
11201210112097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11178430549056 + 22779563041 = 3343416^2 + 150929^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201210112097 - 215 = 11201210079329 is a prime.
It is a super-3 number, since 3×112012101120973 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (11201210112047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600605056048 + 5600605056049.
It is an arithmetic number, because the mean of its divisors is an integer number (5600605056049).
Almost surely, 211201210112097 is an apocalyptic number.
It is an amenable number.
11201210112097 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201210112097 is an equidigital number, since it uses as much as digits as its factorization.
11201210112097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 28.
The spelling of 11201210112097 in words is "eleven trillion, two hundred one billion, two hundred ten million, one hundred twelve thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •