Base | Representation |
---|---|
bin | 11010010100101100… |
… | …01110111010000101 |
3 | 1100110220022101101012 |
4 | 31022112032322011 |
5 | 212420323302401 |
6 | 10254155012005 |
7 | 1010132043563 |
oct | 151226167205 |
9 | 40426271335 |
10 | 14132244101 |
11 | 5aa2313188 |
12 | 28a4a3a005 |
13 | 1442b31c21 |
14 | 980c9ca33 |
15 | 57aa568bb |
hex | 34a58ee85 |
14132244101 has 2 divisors, whose sum is σ = 14132244102. Its totient is φ = 14132244100.
The previous prime is 14132244089. The next prime is 14132244173. The reversal of 14132244101 is 10144223141.
14132244101 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., 7721839876 + 6410404225 = 87874^2 + 80065^2 .
It is a cyclic number.
It is not a de Polignac number, because 14132244101 - 26 = 14132244037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14132243101) 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, 7066122050 + 7066122051.
It is an arithmetic number, because the mean of its divisors is an integer number (7066122051).
Almost surely, 214132244101 is an apocalyptic number.
It is an amenable number.
14132244101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14132244101 is an equidigital number, since it uses as much as digits as its factorization.
14132244101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 14132244101 its reverse (10144223141), we get a palindrome (24276467242).
The spelling of 14132244101 in words is "fourteen billion, one hundred thirty-two million, two hundred forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •