Base | Representation |
---|---|
bin | 10111100101111101… |
… | …01110000101000011 |
3 | 1012200202011222001220 |
4 | 23302332232011003 |
5 | 201420103300111 |
6 | 5452514130123 |
7 | 625613104122 |
oct | 136276560503 |
9 | 35622158056 |
10 | 12666462531 |
11 | 540a984858 |
12 | 2555b80943 |
13 | 126b260a58 |
14 | 882345ab9 |
15 | 4e201ae06 |
hex | 2f2fae143 |
12666462531 has 8 divisors (see below), whose sum is σ = 16894012944. Its totient is φ = 8441610240.
The previous prime is 12666462491. The next prime is 12666462581. The reversal of 12666462531 is 13526466621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-12666462531 is a prime.
It is a super-2 number, since 2×126664625312 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (12666462581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 663550 + ... + 682371.
It is an arithmetic number, because the mean of its divisors is an integer number (2111751618).
Almost surely, 212666462531 is an apocalyptic number.
12666462531 is a deficient number, since it is larger than the sum of its proper divisors (4227550413).
12666462531 is a wasteful number, since it uses less digits than its factorization.
12666462531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1349061.
The product of its digits is 311040, while the sum is 42.
The spelling of 12666462531 in words is "twelve billion, six hundred sixty-six million, four hundred sixty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •