Base | Representation |
---|---|
bin | 1010001010101100… |
… | …0100110110111000 |
3 | 21001012110210001111 |
4 | 2202223010312320 |
5 | 21042133413310 |
6 | 1130452130104 |
7 | 124426553314 |
oct | 24253046670 |
9 | 7035423044 |
10 | 2729201080 |
11 | 1180621191 |
12 | 642006934 |
13 | 34656bba8 |
14 | 1bc674b44 |
15 | 10e90228a |
hex | a2ac4db8 |
2729201080 has 128 divisors (see below), whose sum is σ = 6789847680. Its totient is φ = 982958080.
The previous prime is 2729201053. The next prime is 2729201081. The reversal of 2729201080 is 801029272.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2729201081) 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, 1476717 + ... + 1478563.
It is an arithmetic number, because the mean of its divisors is an integer number (53045685).
Almost surely, 22729201080 is an apocalyptic number.
2729201080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2729201080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3394923840).
2729201080 is an abundant number, since it is smaller than the sum of its proper divisors (4060646600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2729201080 is a wasteful number, since it uses less digits than its factorization.
2729201080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1969 (or 1965 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 31.
The square root of 2729201080 is about 52241.7560960579. The cubic root of 2729201080 is about 1397.4786386947.
The spelling of 2729201080 in words is "two billion, seven hundred twenty-nine million, two hundred one thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •