Base | Representation |
---|---|
bin | 1111001000100… |
… | …01010111010001 |
3 | 22211212200001001 |
4 | 13210101113101 |
5 | 224444330232 |
6 | 20332542001 |
7 | 3101022112 |
oct | 744212721 |
9 | 284780031 |
10 | 126948817 |
11 | 65728586 |
12 | 36621901 |
13 | 203baa58 |
14 | 12c08209 |
15 | b2296e7 |
hex | 79115d1 |
126948817 has 2 divisors, whose sum is σ = 126948818. Its totient is φ = 126948816.
The previous prime is 126948793. The next prime is 126948821. The reversal of 126948817 is 718849621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124746561 + 2202256 = 11169^2 + 1484^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126948817 is a prime.
It is a super-4 number, since 4×1269488174 (a number of 34 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (126946817) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63474408 + 63474409.
It is an arithmetic number, because the mean of its divisors is an integer number (63474409).
Almost surely, 2126948817 is an apocalyptic number.
It is an amenable number.
126948817 is a deficient number, since it is larger than the sum of its proper divisors (1).
126948817 is an equidigital number, since it uses as much as digits as its factorization.
126948817 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 193536, while the sum is 46.
The square root of 126948817 is about 11267.1565623275. The cubic root of 126948817 is about 502.5850348242.
It can be divided in two parts, 126948 and 817, that added together give a triangular number (127765 = T505).
The spelling of 126948817 in words is "one hundred twenty-six million, nine hundred forty-eight thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •