Base | Representation |
---|---|
bin | 1011100110000001101000… |
… | …0110000011000110011011 |
3 | 1200010200120010020120221120 |
4 | 2321200122012003012123 |
5 | 3132330200041241312 |
6 | 43040145454140323 |
7 | 2454001602215265 |
oct | 271403206030633 |
9 | 50120503216846 |
10 | 12747900727707 |
11 | 4075399695172 |
12 | 151a7661b16a3 |
13 | 716177a04992 |
14 | 3210048b6b35 |
15 | 1719073eb28c |
hex | b981a18319b |
12747900727707 has 8 divisors (see below), whose sum is σ = 16997217974784. Its totient is φ = 8498591982888.
The previous prime is 12747900727699. The next prime is 12747900727721. The reversal of 12747900727707 is 70772700974721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12747900727707 - 23 = 12747900727699 is a prime.
It is a Smith number, since the sum of its digits (60) 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 (12747900727777) 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, 3499578 + ... + 6143520.
It is an arithmetic number, because the mean of its divisors is an integer number (2124652246848).
Almost surely, 212747900727707 is an apocalyptic number.
12747900727707 is a deficient number, since it is larger than the sum of its proper divisors (4249317247077).
12747900727707 is a wasteful number, since it uses less digits than its factorization.
12747900727707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4251129.
The product of its (nonzero) digits is 16941456, while the sum is 60.
The spelling of 12747900727707 in words is "twelve trillion, seven hundred forty-seven billion, nine hundred million, seven hundred twenty-seven thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •