Base | Representation |
---|---|
bin | 11011110001010100… |
… | …00111110101101001 |
3 | 1102111001022100011112 |
4 | 31320222013311221 |
5 | 221013224204321 |
6 | 10503232040105 |
7 | 1035315123302 |
oct | 157052076551 |
9 | 42431270145 |
10 | 14909209961 |
11 | 6360951128 |
12 | 2a81093035 |
13 | 1537aab639 |
14 | a1614d7a9 |
15 | 5c3d7da5b |
hex | 378a87d69 |
14909209961 has 2 divisors, whose sum is σ = 14909209962. Its totient is φ = 14909209960.
The previous prime is 14909209949. The next prime is 14909209963. The reversal of 14909209961 is 16990290941.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12200527936 + 2708682025 = 110456^2 + 52045^2 .
It is a cyclic number.
It is not a de Polignac number, because 14909209961 - 214 = 14909193577 is a prime.
It is a super-2 number, since 2×149092099612 (a number of 21 digits) contains 22 as substring.
Together with 14909209963, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14909209963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7454604980 + 7454604981.
It is an arithmetic number, because the mean of its divisors is an integer number (7454604981).
Almost surely, 214909209961 is an apocalyptic number.
It is an amenable number.
14909209961 is a deficient number, since it is larger than the sum of its proper divisors (1).
14909209961 is an equidigital number, since it uses as much as digits as its factorization.
14909209961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 314928, while the sum is 50.
The spelling of 14909209961 in words is "fourteen billion, nine hundred nine million, two hundred nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •