Base | Representation |
---|---|
bin | 1010010001000101… |
… | …0111100000000100 |
3 | 21010001221010101120 |
4 | 2210101113200010 |
5 | 21121020004012 |
6 | 1133250553540 |
7 | 125203515312 |
oct | 24421274004 |
9 | 7101833346 |
10 | 2756016132 |
11 | 1194776791 |
12 | 64ab988b0 |
13 | 34bc9a29c |
14 | 1c20550b2 |
15 | 111e4c58c |
hex | a4457804 |
2756016132 has 48 divisors (see below), whose sum is σ = 6832687680. Its totient is φ = 864614016.
The previous prime is 2756016119. The next prime is 2756016143. The reversal of 2756016132 is 2316106572.
It is a junction number, because it is equal to n+sod(n) for n = 2756016093 and 2756016102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35583 + ... + 82329.
It is an arithmetic number, because the mean of its divisors is an integer number (142347660).
Almost surely, 22756016132 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 2756016132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3416343840).
2756016132 is an abundant number, since it is smaller than the sum of its proper divisors (4076671548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2756016132 is a wasteful number, since it uses less digits than its factorization.
2756016132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46805 (or 46769 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 33.
The square root of 2756016132 is about 52497.7726384653. The cubic root of 2756016132 is about 1402.0405841448.
The spelling of 2756016132 in words is "two billion, seven hundred fifty-six million, sixteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •