Base | Representation |
---|---|
bin | 11010011000101000… |
… | …01011101100111111 |
3 | 1100120012102211012201 |
4 | 31030110023230333 |
5 | 213002301323434 |
6 | 10301334412331 |
7 | 1011012506242 |
oct | 151424135477 |
9 | 40505384181 |
10 | 14165261119 |
11 | 6009a14379 |
12 | 28b3b010a7 |
13 | 1449922219 |
14 | 985415259 |
15 | 57d8c9614 |
hex | 34c50bb3f |
14165261119 has 2 divisors, whose sum is σ = 14165261120. Its totient is φ = 14165261118.
The previous prime is 14165261113. The next prime is 14165261147. The reversal of 14165261119 is 91116256141.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14165261119 - 215 = 14165228351 is a prime.
It is a super-2 number, since 2×141652611192 (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 (14165261113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7082630559 + 7082630560.
It is an arithmetic number, because the mean of its divisors is an integer number (7082630560).
Almost surely, 214165261119 is an apocalyptic number.
14165261119 is a deficient number, since it is larger than the sum of its proper divisors (1).
14165261119 is an equidigital number, since it uses as much as digits as its factorization.
14165261119 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12960, while the sum is 37.
The spelling of 14165261119 in words is "fourteen billion, one hundred sixty-five million, two hundred sixty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •