Base | Representation |
---|---|
bin | 1001001110011010000010… |
… | …0111010010101001101011 |
3 | 1022220200010221112111011221 |
4 | 2103212200213102221223 |
5 | 2312141043241043202 |
6 | 33323403113202511 |
7 | 2064546532124041 |
oct | 223464047225153 |
9 | 38820127474157 |
10 | 10143112440427 |
11 | 32607405a677a |
12 | 1179977a00437 |
13 | 5876507acb35 |
14 | 270d01c72391 |
15 | 128ca4019037 |
hex | 939a09d2a6b |
10143112440427 has 2 divisors, whose sum is σ = 10143112440428. Its totient is φ = 10143112440426.
The previous prime is 10143112440403. The next prime is 10143112440443. The reversal of 10143112440427 is 72404421134101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10143112440427 - 211 = 10143112438379 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10143112440392 and 10143112440401.
It is not a weakly prime, because it can be changed into another prime (10143112440497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071556220213 + 5071556220214.
It is an arithmetic number, because the mean of its divisors is an integer number (5071556220214).
Almost surely, 210143112440427 is an apocalyptic number.
10143112440427 is a deficient number, since it is larger than the sum of its proper divisors (1).
10143112440427 is an equidigital number, since it uses as much as digits as its factorization.
10143112440427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21504, while the sum is 34.
Adding to 10143112440427 its reverse (72404421134101), we get a palindrome (82547533574528).
The spelling of 10143112440427 in words is "ten trillion, one hundred forty-three billion, one hundred twelve million, four hundred forty thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •