Base | Representation |
---|---|
bin | 110000001110… |
… | …000010110001 |
3 | 212210012102012 |
4 | 300032002301 |
5 | 11213443213 |
6 | 1130532305 |
7 | 212304401 |
oct | 60160261 |
9 | 25705365 |
10 | 12640433 |
11 | 7153a43 |
12 | 4297095 |
13 | 2807660 |
14 | 1970801 |
15 | 119a4a8 |
hex | c0e0b1 |
12640433 has 8 divisors (see below), whose sum is σ = 14082600. Its totient is φ = 11265408.
The previous prime is 12640429. The next prime is 12640451. The reversal of 12640433 is 33404621.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 889249 + 11751184 = 943^2 + 3428^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12640433 - 22 = 12640429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12640399 and 12640408.
It is not an unprimeable number, because it can be changed into a prime (12640633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16388 + ... + 17141.
It is an arithmetic number, because the mean of its divisors is an integer number (1760325).
Almost surely, 212640433 is an apocalyptic number.
12640433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12640433 is a deficient number, since it is larger than the sum of its proper divisors (1442167).
12640433 is a wasteful number, since it uses less digits than its factorization.
12640433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33571.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 12640433 is about 3555.3386617874. The cubic root of 12640433 is about 232.9453167921.
The spelling of 12640433 in words is "twelve million, six hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •