Base | Representation |
---|---|
bin | 111010110110010011… |
… | …1001011101111110001 |
3 | 110002012101020022111001 |
4 | 1311230213023233301 |
5 | 4032304310401031 |
6 | 134020105522001 |
7 | 12062502336256 |
oct | 1655447135761 |
9 | 402171208431 |
10 | 126376262641 |
11 | 49661118672 |
12 | 205ab1a3301 |
13 | bbc0203145 |
14 | 618c0db42d |
15 | 3449b63861 |
hex | 1d6c9cbbf1 |
126376262641 has 2 divisors, whose sum is σ = 126376262642. Its totient is φ = 126376262640.
The previous prime is 126376262581. The next prime is 126376262659. The reversal of 126376262641 is 146262673621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83859472225 + 42516790416 = 289585^2 + 206196^2 .
It is a cyclic number.
It is not a de Polignac number, because 126376262641 - 217 = 126376131569 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 126376262591 and 126376262600.
It is not a weakly prime, because it can be changed into another prime (126376262041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63188131320 + 63188131321.
It is an arithmetic number, because the mean of its divisors is an integer number (63188131321).
Almost surely, 2126376262641 is an apocalyptic number.
It is an amenable number.
126376262641 is a deficient number, since it is larger than the sum of its proper divisors (1).
126376262641 is an equidigital number, since it uses as much as digits as its factorization.
126376262641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 870912, while the sum is 46.
It can be divided in two parts, 126376 and 262641, that added together give a cube (389017 = 733).
The spelling of 126376262641 in words is "one hundred twenty-six billion, three hundred seventy-six million, two hundred sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •