Base | Representation |
---|---|
bin | 10010111001000010… |
… | …10100000100101101 |
3 | 222011211021200200011 |
4 | 21130201110010231 |
5 | 131232343441222 |
6 | 4354221533221 |
7 | 506222014636 |
oct | 113441240455 |
9 | 28154250604 |
10 | 10142171437 |
11 | 4334a9a572 |
12 | 1b70714211 |
13 | c582a7c98 |
14 | 6c2db088d |
15 | 3e55e2c77 |
hex | 25c85412d |
10142171437 has 2 divisors, whose sum is σ = 10142171438. Its totient is φ = 10142171436.
The previous prime is 10142171419. The next prime is 10142171453. The reversal of 10142171437 is 73417124101.
10142171437 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10092412521 + 49758916 = 100461^2 + 7054^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10142171437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10142171399 and 10142171408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10142171467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071085718 + 5071085719.
It is an arithmetic number, because the mean of its divisors is an integer number (5071085719).
Almost surely, 210142171437 is an apocalyptic number.
It is an amenable number.
10142171437 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142171437 is an equidigital number, since it uses as much as digits as its factorization.
10142171437 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4704, while the sum is 31.
Adding to 10142171437 its reverse (73417124101), we get a palindrome (83559295538).
The spelling of 10142171437 in words is "ten billion, one hundred forty-two million, one hundred seventy-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •