Base | Representation |
---|---|
bin | 1010001010100011… |
… | …1010100001101000 |
3 | 21001011101222211000 |
4 | 2202220322201220 |
5 | 21042012300342 |
6 | 1130432035000 |
7 | 124422003354 |
oct | 24250724150 |
9 | 7034358730 |
10 | 2728634472 |
11 | 1180274513 |
12 | 641992a60 |
13 | 346401015 |
14 | 1bc568464 |
15 | 10e83e44c |
hex | a2a3a868 |
2728634472 has 64 divisors (see below), whose sum is σ = 7621992000. Its totient is φ = 904450752.
The previous prime is 2728634459. The next prime is 2728634533. The reversal of 2728634472 is 2744368272.
2728634472 is a `hidden beast` number, since 2 + 7 + 2 + 8 + 634 + 4 + 7 + 2 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3378 + ... + 73950.
It is an arithmetic number, because the mean of its divisors is an integer number (119093625).
Almost surely, 22728634472 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 2728634472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3810996000).
2728634472 is an abundant number, since it is smaller than the sum of its proper divisors (4893357528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2728634472 is a wasteful number, since it uses less digits than its factorization.
2728634472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70767 (or 70757 counting only the distinct ones).
The product of its digits is 903168, while the sum is 45.
The square root of 2728634472 is about 52236.3328728195. The cubic root of 2728634472 is about 1397.3819220664.
The spelling of 2728634472 in words is "two billion, seven hundred twenty-eight million, six hundred thirty-four thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •