Base | Representation |
---|---|
bin | 101101110001… |
… | …110101100101 |
3 | 211120200202011 |
4 | 231301311211 |
5 | 11033004423 |
6 | 1105114221 |
7 | 204001132 |
oct | 55616545 |
9 | 24520664 |
10 | 12000613 |
11 | 6857269 |
12 | 4028971 |
13 | 2642371 |
14 | 1845589 |
15 | 10c0b0d |
hex | b71d65 |
12000613 has 2 divisors, whose sum is σ = 12000614. Its totient is φ = 12000612.
The previous prime is 12000607. The next prime is 12000619. The reversal of 12000613 is 31600021.
12000613 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (12000607) and next prime (12000619).
It can be written as a sum of positive squares in only one way, i.e., 11957764 + 42849 = 3458^2 + 207^2 .
It is a cyclic number.
It is not a de Polignac number, because 12000613 - 25 = 12000581 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12000593 and 12000602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12000619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000306 + 6000307.
It is an arithmetic number, because the mean of its divisors is an integer number (6000307).
Almost surely, 212000613 is an apocalyptic number.
It is an amenable number.
12000613 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000613 is an equidigital number, since it uses as much as digits as its factorization.
12000613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 12000613 is about 3464.1900929366. The cubic root of 12000613 is about 228.9467468322.
Adding to 12000613 its reverse (31600021), we get a palindrome (43600634).
The spelling of 12000613 in words is "twelve million, six hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •