Base | Representation |
---|---|
bin | 101000001101… |
… | …101110111101 |
3 | 201211120220221 |
4 | 220031232331 |
5 | 10144321023 |
6 | 1013541341 |
7 | 155414506 |
oct | 50155675 |
9 | 21746827 |
10 | 10542013 |
11 | 5a50409 |
12 | 3644851 |
13 | 22514a1 |
14 | 1585bad |
15 | dd385d |
hex | a0dbbd |
10542013 has 4 divisors (see below), whose sum is σ = 10619100. Its totient is φ = 10464928.
The previous prime is 10542011. The next prime is 10542029. The reversal of 10542013 is 31024501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31024501 = 59 ⋅525839.
It can be written as a sum of positive squares in 2 ways, for example, as 6692569 + 3849444 = 2587^2 + 1962^2 .
It is a cyclic number.
It is not a de Polignac number, because 10542013 - 21 = 10542011 is a prime.
It is a super-2 number, since 2×105420132 = 222268076184338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10542011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38338 + ... + 38611.
It is an arithmetic number, because the mean of its divisors is an integer number (2654775).
Almost surely, 210542013 is an apocalyptic number.
It is an amenable number.
10542013 is a deficient number, since it is larger than the sum of its proper divisors (77087).
10542013 is an equidigital number, since it uses as much as digits as its factorization.
10542013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77086.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 10542013 is about 3246.8466240338. The cubic root of 10542013 is about 219.2676266401.
Adding to 10542013 its reverse (31024501), we get a palindrome (41566514).
The spelling of 10542013 in words is "ten million, five hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •