Base | Representation |
---|---|
bin | 1010101000001001… |
… | …0100000010010000 |
3 | 21100210220212002110 |
4 | 2222002110002100 |
5 | 21320244424242 |
6 | 1151023545320 |
7 | 130456555020 |
oct | 25202240220 |
9 | 7323825073 |
10 | 2852733072 |
11 | 1234325642 |
12 | 67745b240 |
13 | 366031647 |
14 | 1d0c2da80 |
15 | 11a6a439c |
hex | aa094090 |
2852733072 has 160 divisors (see below), whose sum is σ = 8630876160. Its totient is φ = 795110400.
The previous prime is 2852733071. The next prime is 2852733101. The reversal of 2852733072 is 2703372582.
It is a self number, because there is not a number n which added to its sum of digits gives 2852733072.
It is not an unprimeable number, because it can be changed into a prime (2852733071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2992948 + ... + 2993900.
It is an arithmetic number, because the mean of its divisors is an integer number (53942976).
Almost surely, 22852733072 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 2852733072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4315438080).
2852733072 is an abundant number, since it is smaller than the sum of its proper divisors (5778143088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2852733072 is a wasteful number, since it uses less digits than its factorization.
2852733072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181 (or 1175 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 39.
The square root of 2852733072 is about 53410.9826908287. The cubic root of 2852733072 is about 1418.2530046689.
The spelling of 2852733072 in words is "two billion, eight hundred fifty-two million, seven hundred thirty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.460 sec. • engine limits •