Base | Representation |
---|---|
bin | 11010000011111011… |
… | …010000001000100000 |
3 | 2200020012020101120000 |
4 | 122003323100020200 |
5 | 424302141323043 |
6 | 20504424020000 |
7 | 2010306602334 |
oct | 320373201040 |
9 | 80205211500 |
10 | 27983151648 |
11 | 1095a83a011 |
12 | 550b601600 |
13 | 283c59bcca |
14 | 14d66457c4 |
15 | adba392d3 |
hex | 683ed0220 |
27983151648 has 120 divisors (see below), whose sum is σ = 87138848412. Its totient is φ = 8779014144.
The previous prime is 27983151643. The next prime is 27983151659. The reversal of 27983151648 is 84615138972.
27983151648 is a `hidden beast` number, since 2 + 7 + 9 + 83 + 1 + 516 + 48 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 27031305744 + 951845904 = 164412^2 + 30852^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 27983151594 and 27983151603.
It is not an unprimeable number, because it can be changed into a prime (27983151643) by changing a digit.
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 19 ways as a sum of consecutive naturals, for example, 273465 + ... + 361592.
Almost surely, 227983151648 is an apocalyptic number.
It is an amenable number.
27983151648 is an abundant number, since it is smaller than the sum of its proper divisors (59155696764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27983151648 is a wasteful number, since it uses less digits than its factorization.
27983151648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635096 (or 635079 counting only the distinct ones).
The product of its digits is 2903040, while the sum is 54.
The spelling of 27983151648 in words is "twenty-seven billion, nine hundred eighty-three million, one hundred fifty-one thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •