Base | Representation |
---|---|
bin | 101110111100… |
… | …100100011000 |
3 | 212011020122011 |
4 | 232330210120 |
5 | 11122303322 |
6 | 1115435304 |
7 | 206414425 |
oct | 56744430 |
9 | 25136564 |
10 | 12306712 |
11 | 6a46240 |
12 | 4155b34 |
13 | 271b7a2 |
14 | 18c4d4c |
15 | 1131677 |
hex | bbc918 |
12306712 has 32 divisors (see below), whose sum is σ = 25427520. Its totient is φ = 5537440.
The previous prime is 12306673. The next prime is 12306719. The reversal of 12306712 is 21760321.
12306712 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12306719) 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, 8763 + ... + 10069.
It is an arithmetic number, because the mean of its divisors is an integer number (794610).
Almost surely, 212306712 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12306712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12713760).
12306712 is an abundant number, since it is smaller than the sum of its proper divisors (13120808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12306712 is a wasteful number, since it uses less digits than its factorization.
12306712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1431 (or 1427 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 12306712 is about 3508.0923591034. The cubic root of 12306712 is about 230.8770045429.
The spelling of 12306712 in words is "twelve million, three hundred six thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •