Base | Representation |
---|---|
bin | 1000100010001000010… |
… | …0110001001011010001 |
3 | 112000101211211020112122 |
4 | 2020202010301023101 |
5 | 4400214221012114 |
6 | 151203010504025 |
7 | 13406620141256 |
oct | 2104204611321 |
9 | 460354736478 |
10 | 146600563409 |
11 | 5719a218123 |
12 | 244b4295015 |
13 | 10a941c2c11 |
14 | 714a0cd42d |
15 | 3c30438e8e |
hex | 22221312d1 |
146600563409 has 2 divisors, whose sum is σ = 146600563410. Its totient is φ = 146600563408.
The previous prime is 146600563313. The next prime is 146600563411. The reversal of 146600563409 is 904365006641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131990523025 + 14610040384 = 363305^2 + 120872^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146600563409 is a prime.
Together with 146600563411, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 146600563409.
It is not a weakly prime, because it can be changed into another prime (146600563309) 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, 73300281704 + 73300281705.
It is an arithmetic number, because the mean of its divisors is an integer number (73300281705).
Almost surely, 2146600563409 is an apocalyptic number.
It is an amenable number.
146600563409 is a deficient number, since it is larger than the sum of its proper divisors (1).
146600563409 is an equidigital number, since it uses as much as digits as its factorization.
146600563409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 466560, while the sum is 44.
The spelling of 146600563409 in words is "one hundred forty-six billion, six hundred million, five hundred sixty-three thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •