Base | Representation |
---|---|
bin | 1011000011100… |
… | …01010111110101 |
3 | 20110111122002001 |
4 | 11201301113311 |
5 | 142220122221 |
6 | 13111415301 |
7 | 2204161162 |
oct | 541612765 |
9 | 213448061 |
10 | 92739061 |
11 | 48392258 |
12 | 27084531 |
13 | 162a08ac |
14 | c461069 |
15 | 821d391 |
hex | 58715f5 |
92739061 has 2 divisors, whose sum is σ = 92739062. Its totient is φ = 92739060.
The previous prime is 92739043. The next prime is 92739067. The reversal of 92739061 is 16093729.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46580625 + 46158436 = 6825^2 + 6794^2 .
It is an emirp because it is prime and its reverse (16093729) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 92739061 - 215 = 92706293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 92739061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (92739067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46369530 + 46369531.
It is an arithmetic number, because the mean of its divisors is an integer number (46369531).
Almost surely, 292739061 is an apocalyptic number.
It is an amenable number.
92739061 is a deficient number, since it is larger than the sum of its proper divisors (1).
92739061 is an equidigital number, since it uses as much as digits as its factorization.
92739061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20412, while the sum is 37.
The square root of 92739061 is about 9630.1122008002. The cubic root of 92739061 is about 452.6413562828.
The spelling of 92739061 in words is "ninety-two million, seven hundred thirty-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •