Base | Representation |
---|---|
bin | 101110110111… |
… | …111011110010 |
3 | 212010021121010 |
4 | 232313323302 |
5 | 11121201410 |
6 | 1115211350 |
7 | 206305200 |
oct | 56677362 |
9 | 25107533 |
10 | 12287730 |
11 | 6a32a54 |
12 | 4146b56 |
13 | 2712c60 |
14 | 18bc070 |
15 | 112ac20 |
hex | bb7ef2 |
12287730 has 96 divisors (see below), whose sum is σ = 37001664. Its totient is φ = 2588544.
The previous prime is 12287711. The next prime is 12287767. The reversal of 12287730 is 3778221.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18789 + ... + 19431.
It is an arithmetic number, because the mean of its divisors is an integer number (385434).
Almost surely, 212287730 is an apocalyptic number.
12287730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12287730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18500832).
12287730 is an abundant number, since it is smaller than the sum of its proper divisors (24713934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12287730 is a wasteful number, since it uses less digits than its factorization.
12287730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680 (or 673 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 30.
The square root of 12287730 is about 3505.3858560792. The cubic root of 12287730 is about 230.7582411006.
The spelling of 12287730 in words is "twelve million, two hundred eighty-seven thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •