Base | Representation |
---|---|
bin | 1111001110010010… |
… | …01011001110001001 |
3 | 210002120202211001222 |
4 | 13213021023032021 |
5 | 113214231100244 |
6 | 3430553451425 |
7 | 406350404225 |
oct | 74711131611 |
9 | 23076684058 |
10 | 8172909449 |
11 | 3514437921 |
12 | 1701110b75 |
13 | a033037c3 |
14 | 577637785 |
15 | 32c7a2bee |
hex | 1e724b389 |
8172909449 has 2 divisors, whose sum is σ = 8172909450. Its totient is φ = 8172909448.
The previous prime is 8172909421. The next prime is 8172909491. The reversal of 8172909449 is 9449092718.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6126975625 + 2045933824 = 78275^2 + 45232^2 .
It is a cyclic number.
It is not a de Polignac number, because 8172909449 - 232 = 3877942153 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 8172909449.
It is not a weakly prime, because it can be changed into another prime (8172909649) 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, 4086454724 + 4086454725.
It is an arithmetic number, because the mean of its divisors is an integer number (4086454725).
Almost surely, 28172909449 is an apocalyptic number.
It is an amenable number.
8172909449 is a deficient number, since it is larger than the sum of its proper divisors (1).
8172909449 is an equidigital number, since it uses as much as digits as its factorization.
8172909449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 53.
The square root of 8172909449 is about 90404.1450874903. The cubic root of 8172909449 is about 2014.3065382138.
The spelling of 8172909449 in words is "eight billion, one hundred seventy-two million, nine hundred nine thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •