Base | Representation |
---|---|
bin | 1010010101001001… |
… | …1001000110100010 |
3 | 21011021000010222212 |
4 | 2211102121012202 |
5 | 21134400441200 |
6 | 1135100202122 |
7 | 125501432003 |
oct | 24522310642 |
9 | 7137003885 |
10 | 2773062050 |
11 | 11a3359620 |
12 | 654839342 |
13 | 352687c25 |
14 | 1c44111aa |
15 | 1136b8035 |
hex | a54991a2 |
2773062050 has 24 divisors (see below), whose sum is σ = 5626796112. Its totient is φ = 1008386000.
The previous prime is 2773062043. The next prime is 2773062053. The reversal of 2773062050 is 502603772.
It is a happy number.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 2773061998 and 2773062016.
It is not an unprimeable number, because it can be changed into a prime (2773062053) 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 in 11 ways as a sum of consecutive naturals, for example, 2520416 + ... + 2521515.
It is an arithmetic number, because the mean of its divisors is an integer number (234449838).
Almost surely, 22773062050 is an apocalyptic number.
2773062050 is an abundant number, since it is smaller than the sum of its proper divisors (2853734062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2773062050 is a wasteful number, since it uses less digits than its factorization.
2773062050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5041954 (or 5041949 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 32.
The square root of 2773062050 is about 52659.8713443168. The cubic root of 2773062050 is about 1404.9251784896.
The spelling of 2773062050 in words is "two billion, seven hundred seventy-three million, sixty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •