Base | Representation |
---|---|
bin | 100110101100… |
… | …001100110011 |
3 | 201002021220201 |
4 | 212230030303 |
5 | 10044030030 |
6 | 1001220031 |
7 | 152132005 |
oct | 46541463 |
9 | 21067821 |
10 | 10142515 |
11 | 57a8249 |
12 | 3491617 |
13 | 21416b6 |
14 | 14c0375 |
15 | d552ca |
hex | 9ac333 |
10142515 has 4 divisors (see below), whose sum is σ = 12171024. Its totient is φ = 8114008.
The previous prime is 10142507. The next prime is 10142537. The reversal of 10142515 is 51524101.
10142515 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 51524101 = 1201 ⋅42901.
It is a cyclic number.
It is not a de Polignac number, because 10142515 - 23 = 10142507 is a prime.
It is a super-2 number, since 2×101425152 = 205741221050450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10142492 and 10142501.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1014247 + ... + 1014256.
It is an arithmetic number, because the mean of its divisors is an integer number (3042756).
Almost surely, 210142515 is an apocalyptic number.
10142515 is a deficient number, since it is larger than the sum of its proper divisors (2028509).
10142515 is an equidigital number, since it uses as much as digits as its factorization.
10142515 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2028508.
The product of its (nonzero) digits is 200, while the sum is 19.
The square root of 10142515 is about 3184.7315428463. The cubic root of 10142515 is about 216.4621093687.
Adding to 10142515 its reverse (51524101), we get a palindrome (61666616).
The spelling of 10142515 in words is "ten million, one hundred forty-two thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •