Base | Representation |
---|---|
bin | 10100010000100101110101… |
… | …011010011001100010011001 |
3 | 102200110222102111221102220202 |
4 | 110100211311122121202121 |
5 | 43134312441000111022 |
6 | 513300244223031545 |
7 | 24524224326160565 |
oct | 2420456532314231 |
9 | 380428374842822 |
10 | 89101066410137 |
11 | 26432606146061 |
12 | 9bb0472a3b5b5 |
13 | 3a9426b451352 |
14 | 180072c1b46a5 |
15 | a47acac9d592 |
hex | 510975699899 |
89101066410137 has 2 divisors, whose sum is σ = 89101066410138. Its totient is φ = 89101066410136.
The previous prime is 89101066410067. The next prime is 89101066410229. The reversal of 89101066410137 is 73101466010198.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83986575607561 + 5114490802576 = 9164419^2 + 2261524^2 .
It is a cyclic number.
It is not a de Polignac number, because 89101066410137 - 234 = 89083886540953 is a prime.
It is a super-3 number, since 3×891010664101373 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 89101066410091 and 89101066410100.
It is not a weakly prime, because it can be changed into another prime (89101066410337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 44550533205068 + 44550533205069.
It is an arithmetic number, because the mean of its divisors is an integer number (44550533205069).
Almost surely, 289101066410137 is an apocalyptic number.
It is an amenable number.
89101066410137 is a deficient number, since it is larger than the sum of its proper divisors (1).
89101066410137 is an equidigital number, since it uses as much as digits as its factorization.
89101066410137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 47.
The spelling of 89101066410137 in words is "eighty-nine trillion, one hundred one billion, sixty-six million, four hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •