Base | Representation |
---|---|
bin | 11010000011111110… |
… | …11100001010101011 |
3 | 1100010010111212002212 |
4 | 31001333130022223 |
5 | 212123431120441 |
6 | 10232230115335 |
7 | 1003510321454 |
oct | 150177341253 |
9 | 40103455085 |
10 | 13992051371 |
11 | 5a3016a321 |
12 | 2865aabb4b |
13 | 141ca87c4c |
14 | 96a40812b |
15 | 56d5b2eeb |
hex | 341fdc2ab |
13992051371 has 2 divisors, whose sum is σ = 13992051372. Its totient is φ = 13992051370.
The previous prime is 13992051343. The next prime is 13992051373. The reversal of 13992051371 is 17315029931.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13992051371 is a prime.
Together with 13992051373, 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 (13992051373) 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, 6996025685 + 6996025686.
It is an arithmetic number, because the mean of its divisors is an integer number (6996025686).
Almost surely, 213992051371 is an apocalyptic number.
13992051371 is a deficient number, since it is larger than the sum of its proper divisors (1).
13992051371 is an equidigital number, since it uses as much as digits as its factorization.
13992051371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51030, while the sum is 41.
The spelling of 13992051371 in words is "thirteen billion, nine hundred ninety-two million, fifty-one thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •