Base | Representation |
---|---|
bin | 11010001000111101011… |
… | …00110110100010101001 |
3 | 10011212022112120221221011 |
4 | 31010132230312202221 |
5 | 104203414242122311 |
6 | 1524335511143521 |
7 | 121614215365303 |
oct | 15043654664251 |
9 | 3155275527834 |
10 | 898163239081 |
11 | 3169aa808169 |
12 | 1260a1074ba1 |
13 | 66909097924 |
14 | 316854a0973 |
15 | 1856b161321 |
hex | d11eb368a9 |
898163239081 has 2 divisors, whose sum is σ = 898163239082. Its totient is φ = 898163239080.
The previous prime is 898163239079. The next prime is 898163239091. The reversal of 898163239081 is 180932361898.
898163239081 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., 519421462681 + 378741776400 = 720709^2 + 615420^2 .
It is a cyclic number.
It is not a de Polignac number, because 898163239081 - 21 = 898163239079 is a prime.
It is a super-2 number, since 2×8981632390812 (a number of 25 digits) contains 22 as substring.
Together with 898163239079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (898163239091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 449081619540 + 449081619541.
It is an arithmetic number, because the mean of its divisors is an integer number (449081619541).
Almost surely, 2898163239081 is an apocalyptic number.
It is an amenable number.
898163239081 is a deficient number, since it is larger than the sum of its proper divisors (1).
898163239081 is an equidigital number, since it uses as much as digits as its factorization.
898163239081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4478976, while the sum is 58.
The spelling of 898163239081 in words is "eight hundred ninety-eight billion, one hundred sixty-three million, two hundred thirty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •