Base | Representation |
---|---|
bin | 10100101010000001110101… |
… | …000101011010000111011111 |
3 | 102220200002102212020102221112 |
4 | 110222001311011122013133 |
5 | 43401432440311100314 |
6 | 521115301155252235 |
7 | 25064426462460563 |
oct | 2452016505320737 |
9 | 386602385212845 |
10 | 90849112596959 |
11 | 26a4698a6a1962 |
12 | a2331bbbaa07b |
13 | 3b9005ac01062 |
14 | 186119897b6a3 |
15 | a782d967443e |
hex | 52a07515a1df |
90849112596959 has 2 divisors, whose sum is σ = 90849112596960. Its totient is φ = 90849112596958.
The previous prime is 90849112596833. The next prime is 90849112596973. The reversal of 90849112596959 is 95969521194809.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 90849112596959 - 216 = 90849112531423 is a prime.
It is a super-2 number, since 2×908491125969592 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 90849112596959.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (90849112595959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45424556298479 + 45424556298480.
It is an arithmetic number, because the mean of its divisors is an integer number (45424556298480).
Almost surely, 290849112596959 is an apocalyptic number.
90849112596959 is a deficient number, since it is larger than the sum of its proper divisors (1).
90849112596959 is an equidigital number, since it uses as much as digits as its factorization.
90849112596959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 566870400, while the sum is 77.
The spelling of 90849112596959 in words is "ninety trillion, eight hundred forty-nine billion, one hundred twelve million, five hundred ninety-six thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •