Base | Representation |
---|---|
bin | 1010001010011010… |
… | …1100011011101101 |
3 | 21001010022102110001 |
4 | 2202212230123231 |
5 | 21041340134321 |
6 | 1130411344301 |
7 | 124414030501 |
oct | 24246543355 |
9 | 7033272401 |
10 | 2728052461 |
11 | 117aa07212 |
12 | 641752091 |
13 | 346259134 |
14 | 1bc456301 |
15 | 10e776c91 |
hex | a29ac6ed |
2728052461 has 8 divisors (see below), whose sum is σ = 2737260000. Its totient is φ = 2718860880.
The previous prime is 2728052429. The next prime is 2728052479. The reversal of 2728052461 is 1642508272.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2728052461 - 25 = 2728052429 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2728052461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2728052401) 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 7 ways as a sum of consecutive naturals, for example, 406350 + ... + 413008.
It is an arithmetic number, because the mean of its divisors is an integer number (342157500).
Almost surely, 22728052461 is an apocalyptic number.
It is an amenable number.
2728052461 is a deficient number, since it is larger than the sum of its proper divisors (9207539).
2728052461 is an equidigital number, since it uses as much as digits as its factorization.
2728052461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7979.
The product of its (nonzero) digits is 53760, while the sum is 37.
The square root of 2728052461 is about 52230.7616352662. The cubic root of 2728052461 is about 1397.2825622964.
The spelling of 2728052461 in words is "two billion, seven hundred twenty-eight million, fifty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •