Base | Representation |
---|---|
bin | 11010000110100011… |
… | …01000001000001011 |
3 | 1100011122001110000102 |
4 | 31003101220020023 |
5 | 212144440034141 |
6 | 10234320000015 |
7 | 1004161413341 |
oct | 150321501013 |
9 | 40148043012 |
10 | 14013596171 |
11 | 5a41345243 |
12 | 287116000b |
13 | 142438c553 |
14 | 96d215991 |
15 | 57041b99b |
hex | 34346820b |
14013596171 has 2 divisors, whose sum is σ = 14013596172. Its totient is φ = 14013596170.
The previous prime is 14013596153. The next prime is 14013596173. The reversal of 14013596171 is 17169531041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14013596171 - 210 = 14013595147 is a prime.
It is a super-2 number, since 2×140135961712 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 14013596173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14013596173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7006798085 + 7006798086.
It is an arithmetic number, because the mean of its divisors is an integer number (7006798086).
Almost surely, 214013596171 is an apocalyptic number.
14013596171 is a deficient number, since it is larger than the sum of its proper divisors (1).
14013596171 is an equidigital number, since it uses as much as digits as its factorization.
14013596171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 38.
The spelling of 14013596171 in words is "fourteen billion, thirteen million, five hundred ninety-six thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •