Base | Representation |
---|---|
bin | 1010101010010100000000 |
3 | 12020222200100 |
4 | 22222110000 |
5 | 1203413002 |
6 | 135522400 |
7 | 32516652 |
oct | 12522400 |
9 | 5228610 |
10 | 2794752 |
11 | 1639814 |
12 | b29400 |
13 | 76b0cc |
14 | 52a6d2 |
15 | 3a311c |
hex | 2aa500 |
2794752 has 54 divisors (see below), whose sum is σ = 8064602. Its totient is φ = 930816.
The previous prime is 2794747. The next prime is 2794763. The reversal of 2794752 is 2574972.
It can be written as a sum of positive squares in only one way, i.e., 1679616 + 1115136 = 1296^2 + 1056^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a d-powerful number, because it can be written as 25 + 75 + 93 + 4 + 77 + 59 + 29 .
It is a nialpdrome in base 4.
It is a zygodrome in base 4.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1698 + ... + 2910.
22794752 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 2794752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4032301).
2794752 is an abundant number, since it is smaller than the sum of its proper divisors (5269850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2794752 is a wasteful number, since it uses less digits than its factorization.
2794752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1235 (or 1218 counting only the distinct ones).
The product of its digits is 35280, while the sum is 36.
The square root of 2794752 is about 1671.7511776577. The cubic root of 2794752 is about 140.8578618933.
The spelling of 2794752 in words is "two million, seven hundred ninety-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •