Base | Representation |
---|---|
bin | 100111010010… |
… | …101010011101 |
3 | 201101022000202 |
4 | 213102222131 |
5 | 10114100221 |
6 | 1004433245 |
7 | 153356222 |
oct | 47225235 |
9 | 21338022 |
10 | 10300061 |
11 | 58a5652 |
12 | 3548825 |
13 | 2198315 |
14 | 1521949 |
15 | d86d0b |
hex | 9d2a9d |
10300061 has 4 divisors (see below), whose sum is σ = 10551324. Its totient is φ = 10048800.
The previous prime is 10300013. The next prime is 10300093. The reversal of 10300061 is 16000301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16000301 = 401 ⋅39901.
It can be written as a sum of positive squares in 2 ways, for example, as 4020025 + 6280036 = 2005^2 + 2506^2 .
It is a cyclic number.
It is not a de Polignac number, because 10300061 - 26 = 10299997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10300561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 125570 + ... + 125651.
It is an arithmetic number, because the mean of its divisors is an integer number (2637831).
Almost surely, 210300061 is an apocalyptic number.
It is an amenable number.
10300061 is a deficient number, since it is larger than the sum of its proper divisors (251263).
10300061 is an equidigital number, since it uses as much as digits as its factorization.
10300061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251262.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 10300061 is about 3209.3708106107. The cubic root of 10300061 is about 217.5771409112.
Adding to 10300061 its reverse (16000301), we get a palindrome (26300362).
The spelling of 10300061 in words is "ten million, three hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •