Base | Representation |
---|---|
bin | 1011110111101… |
… | …01000111010011 |
3 | 20221100200112122 |
4 | 11323311013103 |
5 | 200442221011 |
6 | 13514044455 |
7 | 2316221633 |
oct | 573650723 |
9 | 227320478 |
10 | 99570131 |
11 | 51228571 |
12 | 2941972b |
13 | 17822c4b |
14 | d31c6c3 |
15 | 8b1c3db |
hex | 5ef51d3 |
99570131 has 2 divisors, whose sum is σ = 99570132. Its totient is φ = 99570130.
The previous prime is 99570113. The next prime is 99570157. The reversal of 99570131 is 13107599.
Together with previous prime (99570113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 99570131 - 218 = 99307987 is a prime.
It is a super-2 number, since 2×995701312 = 19828421974714322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 99570091 and 99570100.
It is not a weakly prime, because it can be changed into another prime (99570101) 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, 49785065 + 49785066.
It is an arithmetic number, because the mean of its divisors is an integer number (49785066).
Almost surely, 299570131 is an apocalyptic number.
99570131 is a deficient number, since it is larger than the sum of its proper divisors (1).
99570131 is an equidigital number, since it uses as much as digits as its factorization.
99570131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8505, while the sum is 35.
The square root of 99570131 is about 9978.4834018001. The cubic root of 99570131 is about 463.4928363543.
The spelling of 99570131 in words is "ninety-nine million, five hundred seventy thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •