Base | Representation |
---|---|
bin | 1111001000110… |
… | …00110110001101 |
3 | 22211221020002022 |
4 | 13210120312031 |
5 | 230001320334 |
6 | 20333335525 |
7 | 3101210351 |
oct | 744306615 |
9 | 284836068 |
10 | 126979469 |
11 | 65749611 |
12 | 366375a5 |
13 | 203cb9a6 |
14 | 12c15461 |
15 | b23382e |
hex | 7918d8d |
126979469 has 2 divisors, whose sum is σ = 126979470. Its totient is φ = 126979468.
The previous prime is 126979427. The next prime is 126979483. The reversal of 126979469 is 964979621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117462244 + 9517225 = 10838^2 + 3085^2 .
It is an emirp because it is prime and its reverse (964979621) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126979469 is a prime.
It is a super-2 number, since 2×1269794692 = 32247571095043922, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 126979469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126979669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63489734 + 63489735.
It is an arithmetic number, because the mean of its divisors is an integer number (63489735).
Almost surely, 2126979469 is an apocalyptic number.
It is an amenable number.
126979469 is a deficient number, since it is larger than the sum of its proper divisors (1).
126979469 is an equidigital number, since it uses as much as digits as its factorization.
126979469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1469664, while the sum is 53.
The square root of 126979469 is about 11268.5167169419. The cubic root of 126979469 is about 502.6254815627.
The spelling of 126979469 in words is "one hundred twenty-six million, nine hundred seventy-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •