Base | Representation |
---|---|
bin | 110000001110… |
… | …101011110001 |
3 | 212210100000101 |
4 | 300032223301 |
5 | 11214034212 |
6 | 1130552401 |
7 | 212315140 |
oct | 60165361 |
9 | 25710011 |
10 | 12643057 |
11 | 7155a09 |
12 | 4298701 |
13 | 28088cb |
14 | 1971757 |
15 | 119b157 |
hex | c0eaf1 |
12643057 has 4 divisors (see below), whose sum is σ = 14449216. Its totient is φ = 10836900.
The previous prime is 12643049. The next prime is 12643109. The reversal of 12643057 is 75034621.
12643057 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 a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 75034621 = 233 ⋅322037.
It is a cyclic number.
It is not a de Polignac number, because 12643057 - 23 = 12643049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12644057) 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, 903069 + ... + 903082.
It is an arithmetic number, because the mean of its divisors is an integer number (3612304).
Almost surely, 212643057 is an apocalyptic number.
It is an amenable number.
12643057 is a deficient number, since it is larger than the sum of its proper divisors (1806159).
12643057 is an equidigital number, since it uses as much as digits as its factorization.
12643057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1806158.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 12643057 is about 3555.7076651491. The cubic root of 12643057 is about 232.9614345474.
Adding to 12643057 its reverse (75034621), we get a palindrome (87677678).
The spelling of 12643057 in words is "twelve million, six hundred forty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •