Base | Representation |
---|---|
bin | 11011011000010111… |
… | …11000100111100101 |
3 | 1101221110120011200002 |
4 | 31230023320213211 |
5 | 220101142103314 |
6 | 10430355031045 |
7 | 1030164366434 |
oct | 155413704745 |
9 | 41843504602 |
10 | 14699956709 |
11 | 6263819059 |
12 | 2a22b9b485 |
13 | 1503634649 |
14 | 9d643d11b |
15 | 5b07e7ade |
hex | 36c2f89e5 |
14699956709 has 2 divisors, whose sum is σ = 14699956710. Its totient is φ = 14699956708.
The previous prime is 14699956643. The next prime is 14699956723. The reversal of 14699956709 is 90765999641.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14315404609 + 384552100 = 119647^2 + 19610^2 .
It is a cyclic number.
It is not a de Polignac number, because 14699956709 - 228 = 14431521253 is a prime.
It is a super-2 number, since 2×146999567092 (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 (14699956759) 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, 7349978354 + 7349978355.
It is an arithmetic number, because the mean of its divisors is an integer number (7349978355).
Almost surely, 214699956709 is an apocalyptic number.
It is an amenable number.
14699956709 is a deficient number, since it is larger than the sum of its proper divisors (1).
14699956709 is an equidigital number, since it uses as much as digits as its factorization.
14699956709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33067440, while the sum is 65.
The spelling of 14699956709 in words is "fourteen billion, six hundred ninety-nine million, nine hundred fifty-six thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •