Base | Representation |
---|---|
bin | 1011000111101100… |
… | …1110110011100101 |
3 | 21201000222111122212 |
4 | 2301323032303211 |
5 | 22103141004443 |
6 | 1212112533205 |
7 | 133654612022 |
oct | 26173166345 |
9 | 7630874585 |
10 | 2985094373 |
11 | 12a200a648 |
12 | 6b3851205 |
13 | 387595b41 |
14 | 204646549 |
15 | 1270ec618 |
hex | b1ecece5 |
2985094373 has 2 divisors, whose sum is σ = 2985094374. Its totient is φ = 2985094372.
The previous prime is 2985094369. The next prime is 2985094423. The reversal of 2985094373 is 3734905892.
It is a happy number.
It is an a-pointer prime, because the next prime (2985094423) can be obtained adding 2985094373 to its sum of digits (50).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2914164289 + 70930084 = 53983^2 + 8422^2 .
It is a cyclic number.
It is not a de Polignac number, because 2985094373 - 22 = 2985094369 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2985093373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1492547186 + 1492547187.
It is an arithmetic number, because the mean of its divisors is an integer number (1492547187).
Almost surely, 22985094373 is an apocalyptic number.
It is an amenable number.
2985094373 is a deficient number, since it is larger than the sum of its proper divisors (1).
2985094373 is an equidigital number, since it uses as much as digits as its factorization.
2985094373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 50.
The square root of 2985094373 is about 54636.0171773163. The cubic root of 2985094373 is about 1439.8569773398.
The spelling of 2985094373 in words is "two billion, nine hundred eighty-five million, ninety-four thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •