Base | Representation |
---|---|
bin | 100110101100… |
… | …010100100101 |
3 | 201002022121011 |
4 | 212230110211 |
5 | 10044034023 |
6 | 1001222221 |
7 | 152133316 |
oct | 46542445 |
9 | 21068534 |
10 | 10143013 |
11 | 57a8661 |
12 | 3491971 |
13 | 21419aa |
14 | 14c060d |
15 | d5550d |
hex | 9ac525 |
10143013 has 2 divisors, whose sum is σ = 10143014. Its totient is φ = 10143012.
The previous prime is 10142963. The next prime is 10143037. The reversal of 10143013 is 31034101.
10143013 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., 9253764 + 889249 = 3042^2 + 943^2 .
It is a cyclic number.
It is not a de Polignac number, because 10143013 - 29 = 10142501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10142984 and 10143002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10143053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071506 + 5071507.
It is an arithmetic number, because the mean of its divisors is an integer number (5071507).
Almost surely, 210143013 is an apocalyptic number.
It is an amenable number.
10143013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10143013 is an equidigital number, since it uses as much as digits as its factorization.
10143013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 10143013 is about 3184.8097274406. The cubic root of 10143013 is about 216.4656520918.
Adding to 10143013 its reverse (31034101), we get a palindrome (41177114).
The spelling of 10143013 in words is "ten million, one hundred forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •