Base | Representation |
---|---|
bin | 10000010010111… |
… | …00001010010101 |
3 | 100112012200200111 |
4 | 20021130022111 |
5 | 234443123443 |
6 | 21321443021 |
7 | 3246603016 |
oct | 1011341225 |
9 | 315180614 |
10 | 136692373 |
11 | 70183004 |
12 | 39940471 |
13 | 2241c97c |
14 | 1422300d |
15 | c00169d |
hex | 825c295 |
136692373 has 2 divisors, whose sum is σ = 136692374. Its totient is φ = 136692372.
The previous prime is 136692331. The next prime is 136692377. The reversal of 136692373 is 373296631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132664324 + 4028049 = 11518^2 + 2007^2 .
It is a cyclic number.
It is not a de Polignac number, because 136692373 - 29 = 136691861 is a prime.
It is a super-2 number, since 2×1366923732 = 37369609672742258, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136692377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68346186 + 68346187.
It is an arithmetic number, because the mean of its divisors is an integer number (68346187).
Almost surely, 2136692373 is an apocalyptic number.
It is an amenable number.
136692373 is a deficient number, since it is larger than the sum of its proper divisors (1).
136692373 is an equidigital number, since it uses as much as digits as its factorization.
136692373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 122472, while the sum is 40.
The square root of 136692373 is about 11691.5513512964. The cubic root of 136692373 is about 515.1275305495.
It can be divided in two parts, 1366 and 92373, that added together give a palindrome (93739).
The spelling of 136692373 in words is "one hundred thirty-six million, six hundred ninety-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •