Base | Representation |
---|---|
bin | 101101110100… |
… | …110110110011 |
3 | 211121022201011 |
4 | 231310312303 |
5 | 11033403404 |
6 | 1105251351 |
7 | 204052156 |
oct | 55646663 |
9 | 24538634 |
10 | 12012979 |
11 | 6865590 |
12 | 4033b57 |
13 | 2647b94 |
14 | 1849c9d |
15 | 10c4604 |
hex | b74db3 |
12012979 has 4 divisors (see below), whose sum is σ = 13105080. Its totient is φ = 10920880.
The previous prime is 12012971. The next prime is 12013009. The reversal of 12012979 is 97921021.
12012979 = 354 + 364 + ... + 404.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 97921021 = 11 ⋅8901911.
It is a cyclic number.
It is not a de Polignac number, because 12012979 - 23 = 12012971 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12012979.
It is not an unprimeable number, because it can be changed into a prime (12012971) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 546034 + ... + 546055.
It is an arithmetic number, because the mean of its divisors is an integer number (3276270).
Almost surely, 212012979 is an apocalyptic number.
12012979 is a deficient number, since it is larger than the sum of its proper divisors (1092101).
12012979 is a wasteful number, since it uses less digits than its factorization.
12012979 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1092100.
The product of its (nonzero) digits is 2268, while the sum is 31.
The square root of 12012979 is about 3465.9744661495. The cubic root of 12012979 is about 229.0253590269.
The spelling of 12012979 in words is "twelve million, twelve thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •