Base | Representation |
---|---|
bin | 101111010000… |
… | …110100110101 |
3 | 212022110110020 |
4 | 233100310311 |
5 | 11132432220 |
6 | 1121315353 |
7 | 210211350 |
oct | 57206465 |
9 | 25273406 |
10 | 12389685 |
11 | 6aa2610 |
12 | 4195b59 |
13 | 274a499 |
14 | 1907297 |
15 | 114b040 |
hex | bd0d35 |
12389685 has 64 divisors (see below), whose sum is σ = 26210304. Its totient is φ = 4838400.
The previous prime is 12389681. The next prime is 12389687. The reversal of 12389685 is 58698321.
12389685 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12389685 - 22 = 12389681 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12389681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 19320 + ... + 19950.
It is an arithmetic number, because the mean of its divisors is an integer number (409536).
Almost surely, 212389685 is an apocalyptic number.
12389685 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12389685 is an abundant number, since it is smaller than the sum of its proper divisors (13820619).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12389685 is a wasteful number, since it uses less digits than its factorization.
12389685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674.
The product of its digits is 103680, while the sum is 42.
The square root of 12389685 is about 3519.8984360348. The cubic root of 12389685 is about 231.3947075780.
The spelling of 12389685 in words is "twelve million, three hundred eighty-nine thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •