Base | Representation |
---|---|
bin | 1000100010011000000… |
… | …1000100011001110001 |
3 | 112000120110021110020201 |
4 | 2020212001010121301 |
5 | 4400333133434244 |
6 | 151213332235201 |
7 | 13411352254411 |
oct | 2104601043161 |
9 | 460513243221 |
10 | 146666702449 |
11 | 57223591393 |
12 | 2451246bb01 |
13 | 10aa4b0c247 |
14 | 7154bc8641 |
15 | 3c36150ad4 |
hex | 2226044671 |
146666702449 has 2 divisors, whose sum is σ = 146666702450. Its totient is φ = 146666702448.
The previous prime is 146666702443. The next prime is 146666702461. The reversal of 146666702449 is 944207666641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145575060849 + 1091641600 = 381543^2 + 33040^2 .
It is a cyclic number.
It is not a de Polignac number, because 146666702449 - 217 = 146666571377 is a prime.
It is a super-2 number, since 2×1466667024492 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 146666702449.
It is not a weakly prime, because it can be changed into another prime (146666702443) 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, 73333351224 + 73333351225.
It is an arithmetic number, because the mean of its divisors is an integer number (73333351225).
Almost surely, 2146666702449 is an apocalyptic number.
It is an amenable number.
146666702449 is a deficient number, since it is larger than the sum of its proper divisors (1).
146666702449 is an equidigital number, since it uses as much as digits as its factorization.
146666702449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10450944, while the sum is 55.
The spelling of 146666702449 in words is "one hundred forty-six billion, six hundred sixty-six million, seven hundred two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •