Base | Representation |
---|---|
bin | 10111011100011100… |
… | …10100000000111001 |
3 | 1012111012000210001111 |
4 | 23232032110000321 |
5 | 201234141221433 |
6 | 5440543520321 |
7 | 623623610251 |
oct | 135616240071 |
9 | 35435023044 |
10 | 12586663993 |
11 | 5379930a52 |
12 | 25332b90a1 |
13 | 1257871297 |
14 | 8758d2961 |
15 | 4da006dcd |
hex | 2ee394039 |
12586663993 has 4 divisors (see below), whose sum is σ = 12642112080. Its totient is φ = 12531215908.
The previous prime is 12586663987. The next prime is 12586663997. The reversal of 12586663993 is 39936668521.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12586663993 is a prime.
It is a super-2 number, since 2×125866639932 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (58) 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 not an unprimeable number, because it can be changed into a prime (12586663997) 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, 27723703 + ... + 27724156.
It is an arithmetic number, because the mean of its divisors is an integer number (3160528020).
Almost surely, 212586663993 is an apocalyptic number.
It is an amenable number.
12586663993 is a deficient number, since it is larger than the sum of its proper divisors (55448087).
12586663993 is an equidigital number, since it uses as much as digits as its factorization.
12586663993 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55448086.
The product of its digits is 12597120, while the sum is 58.
The spelling of 12586663993 in words is "twelve billion, five hundred eighty-six million, six hundred sixty-three thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •