Base | Representation |
---|---|
bin | 101101000111111011… |
… | …0100101011011010101 |
3 | 100021010022120210120201 |
4 | 1122033312211123111 |
5 | 3041424044401402 |
6 | 112303321500501 |
7 | 10000224425056 |
oct | 1321766453325 |
9 | 307108523521 |
10 | 96902731477 |
11 | 3810707a452 |
12 | 16944641731 |
13 | 91a3c2ca86 |
14 | 499397872d |
15 | 27c2380687 |
hex | 168fda56d5 |
96902731477 has 2 divisors, whose sum is σ = 96902731478. Its totient is φ = 96902731476.
The previous prime is 96902731463. The next prime is 96902731481. The reversal of 96902731477 is 77413720969.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49337738641 + 47564992836 = 222121^2 + 218094^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-96902731477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (96902738477) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48451365738 + 48451365739.
It is an arithmetic number, because the mean of its divisors is an integer number (48451365739).
Almost surely, 296902731477 is an apocalyptic number.
It is an amenable number.
96902731477 is a deficient number, since it is larger than the sum of its proper divisors (1).
96902731477 is an equidigital number, since it uses as much as digits as its factorization.
96902731477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4000752, while the sum is 55.
The spelling of 96902731477 in words is "ninety-six billion, nine hundred two million, seven hundred thirty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •