Base | Representation |
---|---|
bin | 1010001010111011… |
… | …0101011110110000 |
3 | 21001021022212000220 |
4 | 2202232311132300 |
5 | 21042411433142 |
6 | 1130525213040 |
7 | 124441126623 |
oct | 24256653660 |
9 | 7037285026 |
10 | 2730186672 |
11 | 1181134724 |
12 | 642401180 |
13 | 346825695 |
14 | 1bc84ddba |
15 | 10ea492ec |
hex | a2bb57b0 |
2730186672 has 160 divisors (see below), whose sum is σ = 7801375680. Its totient is φ = 818872320.
The previous prime is 2730186671. The next prime is 2730186677. The reversal of 2730186672 is 2766810372.
It is not an unprimeable number, because it can be changed into a prime (2730186671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2673522 + ... + 2674542.
It is an arithmetic number, because the mean of its divisors is an integer number (48758598).
Almost surely, 22730186672 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 2730186672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3900687840).
2730186672 is an abundant number, since it is smaller than the sum of its proper divisors (5071189008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2730186672 is a wasteful number, since it uses less digits than its factorization.
2730186672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191 (or 1185 counting only the distinct ones).
The product of its (nonzero) digits is 169344, while the sum is 42.
The square root of 2730186672 is about 52251.1882352928. The cubic root of 2730186672 is about 1397.6468415204.
The spelling of 2730186672 in words is "two billion, seven hundred thirty million, one hundred eighty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •