Base | Representation |
---|---|
bin | 110000010111011001011101… |
… | …111111111111111111111111 |
3 | 1000220011021100021022210202022 |
4 | 300113121131333333333333 |
5 | 210340102013101004444 |
6 | 2032223304315150355 |
7 | 62543042241616166 |
oct | 6027313577777777 |
9 | 1026137307283668 |
10 | 212714127359999 |
11 | 618606114a3481 |
12 | 1ba3550aa453bb |
13 | 918cb18c2a4c5 |
14 | 3a755c0c943dd |
15 | 198d2b14569ee |
hex | c1765dffffff |
212714127359999 has 4 divisors (see below), whose sum is σ = 213028328435064. Its totient is φ = 212399926284936.
The previous prime is 212714127359933. The next prime is 212714127360083. The reversal of 212714127359999 is 999953721417212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212714127359999 - 216 = 212714127294463 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212714127359399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (37) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 157100536517 + ... + 157100537870.
It is an arithmetic number, because the mean of its divisors is an integer number (53257082108766).
Almost surely, 2212714127359999 is an apocalyptic number.
212714127359999 is a deficient number, since it is larger than the sum of its proper divisors (314201075065).
212714127359999 is an equidigital number, since it uses as much as digits as its factorization.
212714127359999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314201075064.
The product of its digits is 154314720, while the sum is 71.
The spelling of 212714127359999 in words is "two hundred twelve trillion, seven hundred fourteen billion, one hundred twenty-seven million, three hundred fifty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •