Base | Representation |
---|---|
bin | 101010010100110100… |
… | …0010001101110111101 |
3 | 22200121110201110201001 |
4 | 1110221220101232331 |
5 | 2442122020044334 |
6 | 105431110450301 |
7 | 6365256343462 |
oct | 1245150215675 |
9 | 280543643631 |
10 | 90892737469 |
11 | 35602642a56 |
12 | 15747963991 |
13 | 8756a750c1 |
14 | 45836c7669 |
15 | 256e921714 |
hex | 1529a11bbd |
90892737469 has 2 divisors, whose sum is σ = 90892737470. Its totient is φ = 90892737468.
The previous prime is 90892737443. The next prime is 90892737511. The reversal of 90892737469 is 96473729809.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86310801369 + 4581936100 = 293787^2 + 67690^2 .
It is a cyclic number.
It is not a de Polignac number, because 90892737469 - 217 = 90892606397 is a prime.
It is a super-2 number, since 2×908927374692 (a number of 23 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 90892737469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (90892737869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45446368734 + 45446368735.
It is an arithmetic number, because the mean of its divisors is an integer number (45446368735).
Almost surely, 290892737469 is an apocalyptic number.
It is an amenable number.
90892737469 is a deficient number, since it is larger than the sum of its proper divisors (1).
90892737469 is an equidigital number, since it uses as much as digits as its factorization.
90892737469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41150592, while the sum is 64.
The spelling of 90892737469 in words is "ninety billion, eight hundred ninety-two million, seven hundred thirty-seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •