Base | Representation |
---|---|
bin | 1011000011101… |
… | …01010001101001 |
3 | 20110112110000012 |
4 | 11201311101221 |
5 | 142221130144 |
6 | 13112021305 |
7 | 2204255612 |
oct | 541652151 |
9 | 213473005 |
10 | 92755049 |
11 | 483a3272 |
12 | 27091835 |
13 | 162a7c5a |
14 | c466c09 |
15 | 8222e9e |
hex | 5875469 |
92755049 has 2 divisors, whose sum is σ = 92755050. Its totient is φ = 92755048.
The previous prime is 92755037. The next prime is 92755057. The reversal of 92755049 is 94055729.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58415449 + 34339600 = 7643^2 + 5860^2 .
It is a cyclic number.
It is not a de Polignac number, because 92755049 - 28 = 92754793 is a prime.
It is a super-2 number, since 2×927550492 = 17206998229984802, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 92754997 and 92755015.
It is not a weakly prime, because it can be changed into another prime (92755249) 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, 46377524 + 46377525.
It is an arithmetic number, because the mean of its divisors is an integer number (46377525).
Almost surely, 292755049 is an apocalyptic number.
It is an amenable number.
92755049 is a deficient number, since it is larger than the sum of its proper divisors (1).
92755049 is an equidigital number, since it uses as much as digits as its factorization.
92755049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 41.
The square root of 92755049 is about 9630.9422695809. The cubic root of 92755049 is about 452.6673662298.
The spelling of 92755049 in words is "ninety-two million, seven hundred fifty-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •