Base | Representation |
---|---|
bin | 110000101100… |
… | …011101001110 |
3 | 220000112022000 |
4 | 300230131032 |
5 | 11231440011 |
6 | 1133333130 |
7 | 213333522 |
oct | 60543516 |
9 | 26015260 |
10 | 12765006 |
11 | 72295a1 |
12 | 43371a6 |
13 | 284c277 |
14 | 19a3d82 |
15 | 11c2356 |
hex | c2c74e |
12765006 has 32 divisors (see below), whose sum is σ = 28670880. Its totient is φ = 4209408.
The previous prime is 12764957. The next prime is 12765029. The reversal of 12765006 is 60056721.
12765006 is a `hidden beast` number, since 1 + 2 + 7 + 650 + 0 + 6 = 666.
12765006 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 (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4020 + ... + 6456.
It is an arithmetic number, because the mean of its divisors is an integer number (895965).
Almost surely, 212765006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12765006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14335440).
12765006 is an abundant number, since it is smaller than the sum of its proper divisors (15905874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12765006 is a wasteful number, since it uses less digits than its factorization.
12765006 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2545 (or 2539 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 12765006 is about 3572.8148566641. The cubic root of 12765006 is about 233.7080514198.
The spelling of 12765006 in words is "twelve million, seven hundred sixty-five thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •