Base | Representation |
---|---|
bin | 1011110111100… |
… | …01000101011111 |
3 | 20221022211220112 |
4 | 11323301011133 |
5 | 200441204011 |
6 | 13513440235 |
7 | 2316122552 |
oct | 573610537 |
9 | 227284815 |
10 | 99553631 |
11 | 51217131 |
12 | 2941007b |
13 | 17818598 |
14 | d316699 |
15 | 8b1758b |
hex | 5ef115f |
99553631 has 2 divisors, whose sum is σ = 99553632. Its totient is φ = 99553630.
The previous prime is 99553613. The next prime is 99553633. The reversal of 99553631 is 13635599.
Together with previous prime (99553613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (13635599) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-99553631 is a prime.
It is a super-2 number, since 2×995536312 = 19821850890568322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 99553633, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (99553633) 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, 49776815 + 49776816.
It is an arithmetic number, because the mean of its divisors is an integer number (49776816).
Almost surely, 299553631 is an apocalyptic number.
99553631 is a deficient number, since it is larger than the sum of its proper divisors (1).
99553631 is an equidigital number, since it uses as much as digits as its factorization.
99553631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 109350, while the sum is 41.
The square root of 99553631 is about 9977.6565885983. The cubic root of 99553631 is about 463.4672327782.
The spelling of 99553631 in words is "ninety-nine million, five hundred fifty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •