Base | Representation |
---|---|
bin | 1111001000110… |
… | …11111100001001 |
3 | 22211221212110111 |
4 | 13210123330021 |
5 | 230002222022 |
6 | 20333514321 |
7 | 3101262316 |
oct | 744337411 |
9 | 284855414 |
10 | 126992137 |
11 | 65758088 |
12 | 366429a1 |
13 | 2040469c |
14 | 12c19d0d |
15 | b237477 |
hex | 791bf09 |
126992137 has 2 divisors, whose sum is σ = 126992138. Its totient is φ = 126992136.
The previous prime is 126992123. The next prime is 126992141. The reversal of 126992137 is 731299621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113294736 + 13697401 = 10644^2 + 3701^2 .
It is a cyclic number.
It is not a de Polignac number, because 126992137 - 211 = 126990089 is a prime.
It is a super-2 number, since 2×1269921372 = 32254005719653538, 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 126992137.
It is not a weakly prime, because it can be changed into another prime (126992147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63496068 + 63496069.
It is an arithmetic number, because the mean of its divisors is an integer number (63496069).
Almost surely, 2126992137 is an apocalyptic number.
It is an amenable number.
126992137 is a deficient number, since it is larger than the sum of its proper divisors (1).
126992137 is an equidigital number, since it uses as much as digits as its factorization.
126992137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40824, while the sum is 40.
The square root of 126992137 is about 11269.0787999730. The cubic root of 126992137 is about 502.6421956764.
The spelling of 126992137 in words is "one hundred twenty-six million, nine hundred ninety-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •