Base | Representation |
---|---|
bin | 1011011110011… |
… | …01010100111101 |
3 | 20201010120212102 |
4 | 11233031110331 |
5 | 144120331222 |
6 | 13315114445 |
7 | 2246131406 |
oct | 557152475 |
9 | 221116772 |
10 | 96261437 |
11 | 4a378708 |
12 | 282a2a25 |
13 | 16c34c3c |
14 | cada9ad |
15 | 86b6d92 |
hex | 5bcd53d |
96261437 has 2 divisors, whose sum is σ = 96261438. Its totient is φ = 96261436.
The previous prime is 96261433. The next prime is 96261439. The reversal of 96261437 is 73416269.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84897796 + 11363641 = 9214^2 + 3371^2 .
It is an emirp because it is prime and its reverse (73416269) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 96261437 - 22 = 96261433 is a prime.
Together with 96261439, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 96261437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (96261433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48130718 + 48130719.
It is an arithmetic number, because the mean of its divisors is an integer number (48130719).
Almost surely, 296261437 is an apocalyptic number.
It is an amenable number.
96261437 is a deficient number, since it is larger than the sum of its proper divisors (1).
96261437 is an equidigital number, since it uses as much as digits as its factorization.
96261437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54432, while the sum is 38.
The square root of 96261437 is about 9811.2913013527. The cubic root of 96261437 is about 458.3009739652.
The spelling of 96261437 in words is "ninety-six million, two hundred sixty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •