Base | Representation |
---|---|
bin | 11010000101010100… |
… | …11100010011101101 |
3 | 1100010220201120102212 |
4 | 31002222130103231 |
5 | 212134322333031 |
6 | 10233311500205 |
7 | 1004005201622 |
oct | 150252342355 |
9 | 40126646385 |
10 | 14003324141 |
11 | 5a36569764 |
12 | 2869827665 |
13 | 1422203c21 |
14 | 96bb00349 |
15 | 56e58d12b |
hex | 342a9c4ed |
14003324141 has 2 divisors, whose sum is σ = 14003324142. Its totient is φ = 14003324140.
The previous prime is 14003324129. The next prime is 14003324171. The reversal of 14003324141 is 14142330041.
14003324141 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., 13800375625 + 202948516 = 117475^2 + 14246^2 .
It is a cyclic number.
It is not a de Polignac number, because 14003324141 - 26 = 14003324077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14003324171) 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, 7001662070 + 7001662071.
It is an arithmetic number, because the mean of its divisors is an integer number (7001662071).
Almost surely, 214003324141 is an apocalyptic number.
It is an amenable number.
14003324141 is a deficient number, since it is larger than the sum of its proper divisors (1).
14003324141 is an equidigital number, since it uses as much as digits as its factorization.
14003324141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 14003324141 its reverse (14142330041), we get a palindrome (28145654182).
The spelling of 14003324141 in words is "fourteen billion, three million, three hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •