Base | Representation |
---|---|
bin | 11101110000011… |
… | …01011001111101 |
3 | 122101200210202221 |
4 | 32320031121331 |
5 | 1002400202442 |
6 | 40434045341 |
7 | 6120462301 |
oct | 1670153175 |
9 | 571623687 |
10 | 249615997 |
11 | 1189a1214 |
12 | 6b719851 |
13 | 3c939997 |
14 | 25219d01 |
15 | 16daa467 |
hex | ee0d67d |
249615997 has 2 divisors, whose sum is σ = 249615998. Its totient is φ = 249615996.
The previous prime is 249615979. The next prime is 249616007. The reversal of 249615997 is 799516942.
Together with previous prime (249615979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195608196 + 54007801 = 13986^2 + 7349^2 .
It is a cyclic number.
It is not a de Polignac number, because 249615997 - 27 = 249615869 is a prime.
It is a pancake number, because a pancake can be divided into 249615997 parts by 22343 straight cuts.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (249615917) 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, 124807998 + 124807999.
It is an arithmetic number, because the mean of its divisors is an integer number (124807999).
Almost surely, 2249615997 is an apocalyptic number.
It is an amenable number.
249615997 is a deficient number, since it is larger than the sum of its proper divisors (1).
249615997 is an equidigital number, since it uses as much as digits as its factorization.
249615997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1224720, while the sum is 52.
The square root of 249615997 is about 15799.2403931328. The cubic root of 249615997 is about 629.6378173548.
The spelling of 249615997 in words is "two hundred forty-nine million, six hundred fifteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •