Base | Representation |
---|---|
bin | 1000100001011000110… |
… | …1100101110101010001 |
3 | 111222212222100021222122 |
4 | 2020112031211311101 |
5 | 4344312244042044 |
6 | 151131141144025 |
7 | 13401652432235 |
oct | 2102615456521 |
9 | 458788307878 |
10 | 146401549649 |
11 | 570a7949143 |
12 | 244596bb015 |
13 | 10a61bc27b4 |
14 | 712b8c65c5 |
15 | 3c1cc26dee |
hex | 2216365d51 |
146401549649 has 2 divisors, whose sum is σ = 146401549650. Its totient is φ = 146401549648.
The previous prime is 146401549639. The next prime is 146401549663. The reversal of 146401549649 is 946945104641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145471299649 + 930250000 = 381407^2 + 30500^2 .
It is a cyclic number.
It is not a de Polignac number, because 146401549649 - 220 = 146400501073 is a prime.
It is a super-2 number, since 2×1464015496492 (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 146401549649.
It is not a weakly prime, because it can be changed into another prime (146401549639) 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, 73200774824 + 73200774825.
It is an arithmetic number, because the mean of its divisors is an integer number (73200774825).
Almost surely, 2146401549649 is an apocalyptic number.
It is an amenable number.
146401549649 is a deficient number, since it is larger than the sum of its proper divisors (1).
146401549649 is an equidigital number, since it uses as much as digits as its factorization.
146401549649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 53.
The spelling of 146401549649 in words is "one hundred forty-six billion, four hundred one million, five hundred forty-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •