Base | Representation |
---|---|
bin | 11010001001111000… |
… | …11010100001101101 |
3 | 1100020120201200011001 |
4 | 31010330122201231 |
5 | 212224121333434 |
6 | 10241200000301 |
7 | 1004651354536 |
oct | 150474324155 |
9 | 40216650131 |
10 | 14041589869 |
11 | 5a5612532a |
12 | 287a600091 |
13 | 142a111278 |
14 | 972c2168d |
15 | 572aeb114 |
hex | 344f1a86d |
14041589869 has 2 divisors, whose sum is σ = 14041589870. Its totient is φ = 14041589868.
The previous prime is 14041589851. The next prime is 14041589917. The reversal of 14041589869 is 96898514041.
14041589869 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., 9358240644 + 4683349225 = 96738^2 + 68435^2 .
It is a cyclic number.
It is not a de Polignac number, because 14041589869 - 211 = 14041587821 is a prime.
It is a super-2 number, since 2×140415898692 (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 (14041583869) 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, 7020794934 + 7020794935.
It is an arithmetic number, because the mean of its divisors is an integer number (7020794935).
Almost surely, 214041589869 is an apocalyptic number.
It is an amenable number.
14041589869 is a deficient number, since it is larger than the sum of its proper divisors (1).
14041589869 is an equidigital number, since it uses as much as digits as its factorization.
14041589869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2488320, while the sum is 55.
The spelling of 14041589869 in words is "fourteen billion, forty-one million, five hundred eighty-nine thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •