Base | Representation |
---|---|
bin | 11011010110010011… |
… | …10000100010011101 |
3 | 1101220020221111001212 |
4 | 31223021300202131 |
5 | 220032222401414 |
6 | 10424535314205 |
7 | 1026564141311 |
oct | 155311604235 |
9 | 41806844055 |
10 | 14682622109 |
11 | 6254a59341 |
12 | 2a1921b965 |
13 | 14ccb7549c |
14 | 9d4009b41 |
15 | 5ae02183e |
hex | 36b27089d |
14682622109 has 2 divisors, whose sum is σ = 14682622110. Its totient is φ = 14682622108.
The previous prime is 14682622093. The next prime is 14682622151. The reversal of 14682622109 is 90122628641.
14682622109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14593848025 + 88774084 = 120805^2 + 9422^2 .
It is a cyclic number.
It is not a de Polignac number, because 14682622109 - 24 = 14682622093 is a prime.
It is a super-3 number, since 3×146826221093 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14682622159) 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, 7341311054 + 7341311055.
It is an arithmetic number, because the mean of its divisors is an integer number (7341311055).
Almost surely, 214682622109 is an apocalyptic number.
It is an amenable number.
14682622109 is a deficient number, since it is larger than the sum of its proper divisors (1).
14682622109 is an equidigital number, since it uses as much as digits as its factorization.
14682622109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 41.
The spelling of 14682622109 in words is "fourteen billion, six hundred eighty-two million, six hundred twenty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •