Base | Representation |
---|---|
bin | 101111100010… |
… | …100000100001 |
3 | 212110010210202 |
4 | 233202200201 |
5 | 11142241423 |
6 | 1123034545 |
7 | 210632456 |
oct | 57424041 |
9 | 25403722 |
10 | 12462113 |
11 | 7041a74 |
12 | 420ba55 |
13 | 2774441 |
14 | 192582d |
15 | 1162728 |
hex | be2821 |
12462113 has 4 divisors (see below), whose sum is σ = 13003968. Its totient is φ = 11920260.
The previous prime is 12462103. The next prime is 12462127. The reversal of 12462113 is 31126421.
12462113 is digitally balanced in base 3, 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 a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31126421 = 41 ⋅759181.
It is a cyclic number.
It is not a de Polignac number, because 12462113 - 218 = 12199969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12462103) 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, 270893 + ... + 270938.
It is an arithmetic number, because the mean of its divisors is an integer number (3250992).
Almost surely, 212462113 is an apocalyptic number.
It is an amenable number.
12462113 is a deficient number, since it is larger than the sum of its proper divisors (541855).
12462113 is an equidigital number, since it uses as much as digits as its factorization.
12462113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 541854.
The product of its digits is 288, while the sum is 20.
The square root of 12462113 is about 3530.1718088501. The cubic root of 12462113 is about 231.8447298851.
Adding to 12462113 its reverse (31126421), we get a palindrome (43588534).
The spelling of 12462113 in words is "twelve million, four hundred sixty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •