Base | Representation |
---|---|
bin | 10010111001001110… |
… | …10000110111000101 |
3 | 222011221012221011222 |
4 | 21130213100313011 |
5 | 131233243344031 |
6 | 4354315210125 |
7 | 506241202115 |
oct | 113447206705 |
9 | 28157187158 |
10 | 10143731141 |
11 | 4335965385 |
12 | 1b71146945 |
13 | c58702b9b |
14 | 6c3299045 |
15 | 3e57eee7b |
hex | 25c9d0dc5 |
10143731141 has 2 divisors, whose sum is σ = 10143731142. Its totient is φ = 10143731140.
The previous prime is 10143731083. The next prime is 10143731161. The reversal of 10143731141 is 14113734101.
10143731141 is digitally balanced in base 2, 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., 5209230625 + 4934500516 = 72175^2 + 70246^2 .
It is a cyclic number.
It is not a de Polignac number, because 10143731141 - 226 = 10076622277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10143731141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10143731161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071865570 + 5071865571.
It is an arithmetic number, because the mean of its divisors is an integer number (5071865571).
Almost surely, 210143731141 is an apocalyptic number.
It is an amenable number.
10143731141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10143731141 is an equidigital number, since it uses as much as digits as its factorization.
10143731141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
The spelling of 10143731141 in words is "ten billion, one hundred forty-three million, seven hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •