Base | Representation |
---|---|
bin | 10010111001110111… |
… | …00100001011010111 |
3 | 222012022020022121011 |
4 | 21130323210023113 |
5 | 131241124200033 |
6 | 4355025233051 |
7 | 506334346135 |
oct | 113473441327 |
9 | 28168208534 |
10 | 10149053143 |
11 | 433896a929 |
12 | 1b72a92787 |
13 | c598473b8 |
14 | 6c3c82755 |
15 | 3e6001ccd |
hex | 25cee42d7 |
10149053143 has 2 divisors, whose sum is σ = 10149053144. Its totient is φ = 10149053142.
The previous prime is 10149053119. The next prime is 10149053153. The reversal of 10149053143 is 34135094101.
It is a strong prime.
It is an emirp because it is prime and its reverse (34135094101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10149053143 - 29 = 10149052631 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10149053153) 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, 5074526571 + 5074526572.
It is an arithmetic number, because the mean of its divisors is an integer number (5074526572).
Almost surely, 210149053143 is an apocalyptic number.
10149053143 is a deficient number, since it is larger than the sum of its proper divisors (1).
10149053143 is an equidigital number, since it uses as much as digits as its factorization.
10149053143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 10149053143 in words is "ten billion, one hundred forty-nine million, fifty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •