Base | Representation |
---|---|
bin | 11011001110110110… |
… | …00111110101111101 |
3 | 1101201220020021001102 |
4 | 31213123013311331 |
5 | 214420214041044 |
6 | 10414422422445 |
7 | 1025204334434 |
oct | 154733076575 |
9 | 41656207042 |
10 | 14620065149 |
11 | 6222711378 |
12 | 2a00291a25 |
13 | 14bcc11731 |
14 | 9c99a411b |
15 | 5a87b624e |
hex | 3676c7d7d |
14620065149 has 2 divisors, whose sum is σ = 14620065150. Its totient is φ = 14620065148.
The previous prime is 14620065101. The next prime is 14620065179. The reversal of 14620065149 is 94156002641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14618502649 + 1562500 = 120907^2 + 1250^2 .
It is a cyclic number.
It is not a de Polignac number, because 14620065149 - 228 = 14351629693 is a prime.
It is a super-2 number, since 2×146200651492 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14620065179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7310032574 + 7310032575.
It is an arithmetic number, because the mean of its divisors is an integer number (7310032575).
Almost surely, 214620065149 is an apocalyptic number.
It is an amenable number.
14620065149 is a deficient number, since it is larger than the sum of its proper divisors (1).
14620065149 is an equidigital number, since it uses as much as digits as its factorization.
14620065149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 14620065149 in words is "fourteen billion, six hundred twenty million, sixty-five thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •