Base | Representation |
---|---|
bin | 1111001000010… |
… | …11111110011101 |
3 | 22211211112202201 |
4 | 13210023332131 |
5 | 224443123444 |
6 | 20332251501 |
7 | 3100600555 |
oct | 744137635 |
9 | 284745681 |
10 | 126926749 |
11 | 65712a44 |
12 | 36610b91 |
13 | 203b09b1 |
14 | 12c00165 |
15 | b222dd4 |
hex | 790bf9d |
126926749 has 2 divisors, whose sum is σ = 126926750. Its totient is φ = 126926748.
The previous prime is 126926713. The next prime is 126926773. The reversal of 126926749 is 947629621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113103225 + 13823524 = 10635^2 + 3718^2 .
It is a cyclic number.
It is not a de Polignac number, because 126926749 - 27 = 126926621 is a prime.
It is a super-2 number, since 2×1269267492 = 32220799223418002, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 126926699 and 126926708.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126920749) 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, 63463374 + 63463375.
It is an arithmetic number, because the mean of its divisors is an integer number (63463375).
Almost surely, 2126926749 is an apocalyptic number.
It is an amenable number.
126926749 is a deficient number, since it is larger than the sum of its proper divisors (1).
126926749 is an equidigital number, since it uses as much as digits as its factorization.
126926749 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 326592, while the sum is 46.
The square root of 126926749 is about 11266.1772132343. The cubic root of 126926749 is about 502.5559110416. Note that the first 3 decimals are identical.
The spelling of 126926749 in words is "one hundred twenty-six million, nine hundred twenty-six thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •