Base | Representation |
---|---|
bin | 10000010010100000… |
… | …00010001111000101 |
3 | 211120110111210012201 |
4 | 20021100002033011 |
5 | 120402223223442 |
6 | 4003434314501 |
7 | 426466255366 |
oct | 101120021705 |
9 | 24513453181 |
10 | 8745132997 |
11 | 3788443947 |
12 | 1840888a31 |
13 | a94a25513 |
14 | 5cd62db6d |
15 | 362b357b7 |
hex | 2094023c5 |
8745132997 has 2 divisors, whose sum is σ = 8745132998. Its totient is φ = 8745132996.
The previous prime is 8745132959. The next prime is 8745133003. The reversal of 8745132997 is 7992315478.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4771217476 + 3973915521 = 69074^2 + 63039^2 .
It is a cyclic number.
It is not a de Polignac number, because 8745132997 - 211 = 8745130949 is a prime.
It is a super-2 number, since 2×87451329972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8745132937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4372566498 + 4372566499.
It is an arithmetic number, because the mean of its divisors is an integer number (4372566499).
Almost surely, 28745132997 is an apocalyptic number.
It is an amenable number.
8745132997 is a deficient number, since it is larger than the sum of its proper divisors (1).
8745132997 is an equidigital number, since it uses as much as digits as its factorization.
8745132997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3810240, while the sum is 55.
The square root of 8745132997 is about 93515.4158254135. The cubic root of 8745132997 is about 2060.2605160363.
The spelling of 8745132997 in words is "eight billion, seven hundred forty-five million, one hundred thirty-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •