Base | Representation |
---|---|
bin | 100110101100… |
… | …111011010001 |
3 | 201002102222212 |
4 | 212230323101 |
5 | 10044123424 |
6 | 1001241505 |
7 | 152143454 |
oct | 46547321 |
9 | 21072885 |
10 | 10145489 |
11 | 57aa502 |
12 | 3493295 |
13 | 2142b63 |
14 | 14c149b |
15 | d5610e |
hex | 9aced1 |
10145489 has 2 divisors, whose sum is σ = 10145490. Its totient is φ = 10145488.
The previous prime is 10145483. The next prime is 10145501. The reversal of 10145489 is 98454101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10029889 + 115600 = 3167^2 + 340^2 .
It is a cyclic number.
It is not a de Polignac number, because 10145489 - 212 = 10141393 is a prime.
It is a Chen prime.
It is equal to p673655 and since 10145489 and 673655 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (10145483) 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, 5072744 + 5072745.
It is an arithmetic number, because the mean of its divisors is an integer number (5072745).
Almost surely, 210145489 is an apocalyptic number.
It is an amenable number.
10145489 is a deficient number, since it is larger than the sum of its proper divisors (1).
10145489 is an equidigital number, since it uses as much as digits as its factorization.
10145489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 32.
The square root of 10145489 is about 3185.1984239604. The cubic root of 10145489 is about 216.4832643913.
The spelling of 10145489 in words is "ten million, one hundred forty-five thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •