Base | Representation |
---|---|
bin | 10001100001011… |
… | …01110110100001 |
3 | 101020120210020122 |
4 | 20300231312201 |
5 | 300112112244 |
6 | 22330250025 |
7 | 3433244516 |
oct | 1060556641 |
9 | 336523218 |
10 | 146988449 |
11 | 75a75663 |
12 | 41286915 |
13 | 245b621a |
14 | 1574330d |
15 | cd871ee |
hex | 8c2dda1 |
146988449 has 2 divisors, whose sum is σ = 146988450. Its totient is φ = 146988448.
The previous prime is 146988437. The next prime is 146988461. The reversal of 146988449 is 944889641.
It is a balanced prime because it is at equal distance from previous prime (146988437) and next prime (146988461).
It can be written as a sum of positive squares in only one way, i.e., 127690000 + 19298449 = 11300^2 + 4393^2 .
It is a cyclic number.
It is not a de Polignac number, because 146988449 - 216 = 146922913 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 146988449.
It is not a weakly prime, because it can be changed into another prime (146988349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73494224 + 73494225.
It is an arithmetic number, because the mean of its divisors is an integer number (73494225).
Almost surely, 2146988449 is an apocalyptic number.
It is an amenable number.
146988449 is a deficient number, since it is larger than the sum of its proper divisors (1).
146988449 is an equidigital number, since it uses as much as digits as its factorization.
146988449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1990656, while the sum is 53.
The square root of 146988449 is about 12123.8792884126. The cubic root of 146988449 is about 527.7493848618.
The spelling of 146988449 in words is "one hundred forty-six million, nine hundred eighty-eight thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •