Base | Representation |
---|---|
bin | 1010010101101010… |
… | …1011000010000100 |
3 | 21011102002102111020 |
4 | 2211122223002010 |
5 | 21140424421034 |
6 | 1135214511140 |
7 | 125526042162 |
oct | 24532530204 |
9 | 7142072436 |
10 | 2775232644 |
11 | 11a46013a8 |
12 | 6555054b0 |
13 | 352c67bc2 |
14 | 1c4818232 |
15 | 113996249 |
hex | a56ab084 |
2775232644 has 48 divisors (see below), whose sum is σ = 6836088000. Its totient is φ = 873853056.
The previous prime is 2775232639. The next prime is 2775232667. The reversal of 2775232644 is 4462325772.
It is a junction number, because it is equal to n+sod(n) for n = 2775232596 and 2775232605.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 62134 + ... + 97010.
It is an arithmetic number, because the mean of its divisors is an integer number (142418500).
Almost surely, 22775232644 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2775232644, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3418044000).
2775232644 is an abundant number, since it is smaller than the sum of its proper divisors (4060855356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2775232644 is a wasteful number, since it uses less digits than its factorization.
2775232644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35252 (or 35250 counting only the distinct ones).
The product of its digits is 564480, while the sum is 42.
The square root of 2775232644 is about 52680.4768771126. The cubic root of 2775232644 is about 1405.2916478521.
The spelling of 2775232644 in words is "two billion, seven hundred seventy-five million, two hundred thirty-two thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •