Base | Representation |
---|---|
bin | 11010110100101001… |
… | …11010000101010101 |
3 | 1101011120202122222222 |
4 | 31122110322011111 |
5 | 213442441111432 |
6 | 10340533032125 |
7 | 1016565542363 |
oct | 153224720525 |
9 | 41146678888 |
10 | 14400332117 |
11 | 611a680726 |
12 | 295a785645 |
13 | 14865386a2 |
14 | 9a8726633 |
15 | 594360112 |
hex | 35a53a155 |
14400332117 has 2 divisors, whose sum is σ = 14400332118. Its totient is φ = 14400332116.
The previous prime is 14400332059. The next prime is 14400332189. The reversal of 14400332117 is 71123300441.
14400332117 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., 14180284561 + 220047556 = 119081^2 + 14834^2 .
It is a cyclic number.
It is not a de Polignac number, because 14400332117 - 210 = 14400331093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14400332417) 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, 7200166058 + 7200166059.
It is an arithmetic number, because the mean of its divisors is an integer number (7200166059).
Almost surely, 214400332117 is an apocalyptic number.
It is an amenable number.
14400332117 is a deficient number, since it is larger than the sum of its proper divisors (1).
14400332117 is an equidigital number, since it uses as much as digits as its factorization.
14400332117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 14400332117 its reverse (71123300441), we get a palindrome (85523632558).
The spelling of 14400332117 in words is "fourteen billion, four hundred million, three hundred thirty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •