Base | Representation |
---|---|
bin | 11001110110011011… |
… | …011111111100010110 |
3 | 2122122102011200012110 |
4 | 121312123133330112 |
5 | 423321210131430 |
6 | 20430134531450 |
7 | 2001560155362 |
oct | 316633377426 |
9 | 78572150173 |
10 | 27756723990 |
11 | 10853a46616 |
12 | 5467806b86 |
13 | 28046c0a48 |
14 | 14b45442a2 |
15 | ac6c0e7b0 |
hex | 6766dff16 |
27756723990 has 128 divisors (see below), whose sum is σ = 74402634240. Its totient is φ = 6585919488.
The previous prime is 27756723979. The next prime is 27756724019. The reversal of 27756723990 is 9932765772.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a self number, because there is not a number n which added to its sum of digits gives 27756723990.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5065132 + ... + 5070608.
It is an arithmetic number, because the mean of its divisors is an integer number (581270580).
Almost surely, 227756723990 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27756723990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37201317120).
27756723990 is an abundant number, since it is smaller than the sum of its proper divisors (46645910250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27756723990 is a wasteful number, since it uses less digits than its factorization.
27756723990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6046.
The product of its (nonzero) digits is 10001880, while the sum is 57.
The spelling of 27756723990 in words is "twenty-seven billion, seven hundred fifty-six million, seven hundred twenty-three thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •