Base | Representation |
---|---|
bin | 1010001010011110… |
… | …1111001101101101 |
3 | 21001010211022200000 |
4 | 2202213233031231 |
5 | 21041422412442 |
6 | 1130421254513 |
7 | 124416250125 |
oct | 24247571555 |
9 | 7033738600 |
10 | 2728325997 |
11 | 1180083781 |
12 | 641864439 |
13 | 3463237a7 |
14 | 1bc4c7c85 |
15 | 10e7ccd4c |
hex | a29ef36d |
2728325997 has 48 divisors (see below), whose sum is σ = 4182796800. Its totient is φ = 1776520512.
The previous prime is 2728325989. The next prime is 2728326023. The reversal of 2728325997 is 7995238272.
2728325997 is a `hidden beast` number, since 27 + 28 + 3 + 2 + 599 + 7 = 666.
It is not a de Polignac number, because 2728325997 - 23 = 2728325989 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2728325947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4494468 + ... + 4495074.
It is an arithmetic number, because the mean of its divisors is an integer number (87141600).
Almost surely, 22728325997 is an apocalyptic number.
2728325997 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
2728325997 is a deficient number, since it is larger than the sum of its proper divisors (1454470803).
2728325997 is an equidigital number, since it uses as much as digits as its factorization.
2728325997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024 (or 1012 counting only the distinct ones).
The product of its digits is 3810240, while the sum is 54.
The square root of 2728325997 is about 52233.3801031486. The cubic root of 2728325997 is about 1397.3292615827.
The spelling of 2728325997 in words is "two billion, seven hundred twenty-eight million, three hundred twenty-five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •