Base | Representation |
---|---|
bin | 101111101001… |
… | …011110101100 |
3 | 212111120222100 |
4 | 233221132230 |
5 | 11144200133 |
6 | 1123415100 |
7 | 211111641 |
oct | 57513654 |
9 | 25446870 |
10 | 12490668 |
11 | 7061473 |
12 | 4224490 |
13 | 2784438 |
14 | 1931dc8 |
15 | 116ae13 |
hex | be97ac |
12490668 has 18 divisors (see below), whose sum is σ = 31573724. Its totient is φ = 4163544.
The previous prime is 12490663. The next prime is 12490711. The reversal of 12490668 is 86609421.
It is a tau number, because it is divible by the number of its divisors (18).
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 346963 = 12490668 / (1 + 2 + 4 + 9 + 0 + 6 + 6 + 8).
It is not an unprimeable number, because it can be changed into a prime (12490663) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 173446 + ... + 173517.
Almost surely, 212490668 is an apocalyptic number.
12490668 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
12490668 is an abundant number, since it is smaller than the sum of its proper divisors (19083056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12490668 is a wasteful number, since it uses less digits than its factorization.
12490668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346973 (or 346968 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 12490668 is about 3534.2139154273. The cubic root of 12490668 is about 232.0216735598.
The spelling of 12490668 in words is "twelve million, four hundred ninety thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •