Base | Representation |
---|---|
bin | 101101110101… |
… | …010001010100 |
3 | 211121102001000 |
4 | 231311101110 |
5 | 11033432201 |
6 | 1105303300 |
7 | 204060132 |
oct | 55652124 |
9 | 24542030 |
10 | 12014676 |
11 | 6866893 |
12 | 4034b30 |
13 | 264889b |
14 | 184a752 |
15 | 10c4d86 |
hex | b75454 |
12014676 has 48 divisors (see below), whose sum is σ = 31752000. Its totient is φ = 3927456.
The previous prime is 12014663. The next prime is 12014687. The reversal of 12014676 is 67641021.
12014676 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 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, 4675 + ... + 6773.
It is an arithmetic number, because the mean of its divisors is an integer number (661500).
Almost surely, 212014676 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 12014676, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15876000).
12014676 is an abundant number, since it is smaller than the sum of its proper divisors (19737324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12014676 is a wasteful number, since it uses less digits than its factorization.
12014676 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2165 (or 2157 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 12014676 is about 3466.2192660015. The cubic root of 12014676 is about 229.0361428559.
Adding to 12014676 its reverse (67641021), we get a palindrome (79655697).
The spelling of 12014676 in words is "twelve million, fourteen thousand, six hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •