Base | Representation |
---|---|
bin | 10010111010010111… |
… | …00110100010110111 |
3 | 222012121010220101212 |
4 | 21131023212202313 |
5 | 131243213212033 |
6 | 4355255312035 |
7 | 506415155531 |
oct | 113513464267 |
9 | 28177126355 |
10 | 10153257143 |
11 | 4340281407 |
12 | 1b7437b61b |
13 | c5a689a83 |
14 | 6c4658851 |
15 | 3e6582748 |
hex | 25d2e68b7 |
10153257143 has 2 divisors, whose sum is σ = 10153257144. Its totient is φ = 10153257142.
The previous prime is 10153257133. The next prime is 10153257151. The reversal of 10153257143 is 34175235101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10153257143 - 28 = 10153256887 is a prime.
It is a super-2 number, since 2×101532571432 (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 (10153257133) 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, 5076628571 + 5076628572.
It is an arithmetic number, because the mean of its divisors is an integer number (5076628572).
Almost surely, 210153257143 is an apocalyptic number.
10153257143 is a deficient number, since it is larger than the sum of its proper divisors (1).
10153257143 is an equidigital number, since it uses as much as digits as its factorization.
10153257143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 10153257143 in words is "ten billion, one hundred fifty-three million, two hundred fifty-seven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •