Base | Representation |
---|---|
bin | 1010000100111110… |
… | …0111001010001100 |
3 | 20222112100122010210 |
4 | 2201033213022030 |
5 | 21020014134312 |
6 | 1124234202420 |
7 | 124016012256 |
oct | 24117471214 |
9 | 6875318123 |
10 | 2705224332 |
11 | 1169035098 |
12 | 635b83410 |
13 | 3415c5675 |
14 | 1b93d2cd6 |
15 | 10c767e3c |
hex | a13e728c |
2705224332 has 48 divisors (see below), whose sum is σ = 6689088000. Its totient is φ = 848537280.
The previous prime is 2705224309. The next prime is 2705224339. The reversal of 2705224332 is 2334225072.
It is a self number, because there is not a number n which added to its sum of digits gives 2705224332.
It is not an unprimeable number, because it can be changed into a prime (2705224339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5844 + ... + 73787.
It is an arithmetic number, because the mean of its divisors is an integer number (139356000).
Almost surely, 22705224332 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 2705224332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3344544000).
2705224332 is an abundant number, since it is smaller than the sum of its proper divisors (3983863668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2705224332 is a wasteful number, since it uses less digits than its factorization.
2705224332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79806 (or 79804 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 30.
The square root of 2705224332 is about 52011.7710907829. The cubic root of 2705224332 is about 1393.3741899962.
The spelling of 2705224332 in words is "two billion, seven hundred five million, two hundred twenty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •