Base | Representation |
---|---|
bin | 111011000101000100… |
… | …1100010010011110001 |
3 | 110010110220200120211212 |
4 | 1312022021202103301 |
5 | 4034313140312332 |
6 | 134141211045505 |
7 | 12111000365531 |
oct | 1661211422361 |
9 | 403426616755 |
10 | 126871807217 |
11 | 49895911641 |
12 | 20709140895 |
13 | bc6ba8829c |
14 | 61d7c534c1 |
15 | 34783eb8b2 |
hex | 1d8a2624f1 |
126871807217 has 2 divisors, whose sum is σ = 126871807218. Its totient is φ = 126871807216.
The previous prime is 126871807201. The next prime is 126871807219. The reversal of 126871807217 is 712708178621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123623263201 + 3248544016 = 351601^2 + 56996^2 .
It is a cyclic number.
It is not a de Polignac number, because 126871807217 - 24 = 126871807201 is a prime.
It is a super-2 number, since 2×1268718072172 (a number of 23 digits) contains 22 as substring.
Together with 126871807219, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (126871807219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63435903608 + 63435903609.
It is an arithmetic number, because the mean of its divisors is an integer number (63435903609).
Almost surely, 2126871807217 is an apocalyptic number.
It is an amenable number.
126871807217 is a deficient number, since it is larger than the sum of its proper divisors (1).
126871807217 is an equidigital number, since it uses as much as digits as its factorization.
126871807217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 526848, while the sum is 50.
The spelling of 126871807217 in words is "one hundred twenty-six billion, eight hundred seventy-one million, eight hundred seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •