Base | Representation |
---|---|
bin | 100110101100… |
… | …000100111101 |
3 | 201002021020010 |
4 | 212230010331 |
5 | 10044021023 |
6 | 1001213433 |
7 | 152130360 |
oct | 46540475 |
9 | 21067203 |
10 | 10142013 |
11 | 57a7932 |
12 | 3491279 |
13 | 21413bb |
14 | 14c00d7 |
15 | d55093 |
hex | 9ac13d |
10142013 has 16 divisors (see below), whose sum is σ = 16364160. Its totient is φ = 5454336.
The previous prime is 10142009. The next prime is 10142017. The reversal of 10142013 is 31024101.
It is a happy number.
10142013 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10142009) and next prime (10142017).
It is not a de Polignac number, because 10142013 - 22 = 10142009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10142013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10142017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13848 + ... + 14561.
It is an arithmetic number, because the mean of its divisors is an integer number (1022760).
Almost surely, 210142013 is an apocalyptic number.
It is an amenable number.
10142013 is a deficient number, since it is larger than the sum of its proper divisors (6222147).
10142013 is a wasteful number, since it uses less digits than its factorization.
10142013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28436.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 10142013 is about 3184.6527283206. The cubic root of 10142013 is about 216.4585380726.
Adding to 10142013 its reverse (31024101), we get a palindrome (41166114).
The spelling of 10142013 in words is "ten million, one hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •