Base | Representation |
---|---|
bin | 110000001110… |
… | …101011111101 |
3 | 212210100000211 |
4 | 300032223331 |
5 | 11214034234 |
6 | 1130552421 |
7 | 212315155 |
oct | 60165375 |
9 | 25710024 |
10 | 12643069 |
11 | 7155a1a |
12 | 4298711 |
13 | 280890a |
14 | 1971765 |
15 | 119b164 |
hex | c0eafd |
12643069 has 4 divisors (see below), whose sum is σ = 12718944. Its totient is φ = 12567196.
The previous prime is 12643049. The next prime is 12643109. The reversal of 12643069 is 96034621.
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: 96034621 = 31 ⋅3097891.
It is a cyclic number.
It is not a de Polignac number, because 12643069 - 211 = 12641021 is a prime.
It is a super-2 number, since 2×126430692 = 319694387477522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12643069.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12643049) 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, 37687 + ... + 38020.
It is an arithmetic number, because the mean of its divisors is an integer number (3179736).
Almost surely, 212643069 is an apocalyptic number.
It is an amenable number.
12643069 is a deficient number, since it is larger than the sum of its proper divisors (75875).
12643069 is an equidigital number, since it uses as much as digits as its factorization.
12643069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75874.
The product of its (nonzero) digits is 7776, while the sum is 31.
The square root of 12643069 is about 3555.7093525765. The cubic root of 12643069 is about 232.9615082516.
The spelling of 12643069 in words is "twelve million, six hundred forty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •