Base | Representation |
---|---|
bin | 110110110110000… |
… | …011000110111101 |
3 | 2101010101212021121 |
4 | 312312003012331 |
5 | 3341023410143 |
6 | 231145430541 |
7 | 31542021403 |
oct | 6666030675 |
9 | 2333355247 |
10 | 920138173 |
11 | 432437479 |
12 | 21819b451 |
13 | 118827976 |
14 | 8a2bd473 |
15 | 55ba87ed |
hex | 36d831bd |
920138173 has 2 divisors, whose sum is σ = 920138174. Its totient is φ = 920138172.
The previous prime is 920138147. The next prime is 920138183. The reversal of 920138173 is 371831029.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 609744249 + 310393924 = 24693^2 + 17618^2 .
It is an emirp because it is prime and its reverse (371831029) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-920138173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (920138143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 460069086 + 460069087.
It is an arithmetic number, because the mean of its divisors is an integer number (460069087).
Almost surely, 2920138173 is an apocalyptic number.
It is an amenable number.
920138173 is a deficient number, since it is larger than the sum of its proper divisors (1).
920138173 is an equidigital number, since it uses as much as digits as its factorization.
920138173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 34.
The square root of 920138173 is about 30333.7794051450. The cubic root of 920138173 is about 972.6375141858.
It can be divided in two parts, 9201 and 38173, that added together give a palindrome (47374).
The spelling of 920138173 in words is "nine hundred twenty million, one hundred thirty-eight thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •