Base | Representation |
---|---|
bin | 1010010101011011… |
… | …1100010111001100 |
3 | 21011100020202111010 |
4 | 2211112330113030 |
5 | 21140202130202 |
6 | 1135141525220 |
7 | 125514531102 |
oct | 24526742714 |
9 | 7140222433 |
10 | 2774255052 |
11 | 11a3aa3978 |
12 | 655113810 |
13 | 3529b4c4a |
14 | 1c4641c72 |
15 | 11385176c |
hex | a55bc5cc |
2774255052 has 12 divisors (see below), whose sum is σ = 6473261816. Its totient is φ = 924751680.
The previous prime is 2774255023. The next prime is 2774255053. The reversal of 2774255052 is 2505524772.
It is a tau number, because it is divible by the number of its divisors (12).
It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 2774255052.
It is not an unprimeable number, because it can be changed into a prime (2774255053) 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 in 3 ways as a sum of consecutive naturals, for example, 115593949 + ... + 115593972.
Almost surely, 22774255052 is an apocalyptic number.
It is an amenable number.
2774255052 is an abundant number, since it is smaller than the sum of its proper divisors (3699006764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2774255052 is a wasteful number, since it uses less digits than its factorization.
2774255052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231187928 (or 231187926 counting only the distinct ones).
The product of its (nonzero) digits is 196000, while the sum is 39.
The square root of 2774255052 is about 52671.1975561597. The cubic root of 2774255052 is about 1405.1266210609.
The spelling of 2774255052 in words is "two billion, seven hundred seventy-four million, two hundred fifty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •