Base | Representation |
---|---|
bin | 1100011111000110101000… |
… | …11111111111011100000000 |
3 | 10121012212022021020100021200 |
4 | 12033203110133333130000 |
5 | 12044323412001042003 |
6 | 134221323032221200 |
7 | 5532462650113212 |
oct | 617432437773400 |
9 | 117185267210250 |
10 | 27456996112128 |
11 | 88264a0559380 |
12 | 30b542453a800 |
13 | 124225056181b |
14 | 6accd61b05b2 |
15 | 329345b206a3 |
hex | 18f8d47ff700 |
27456996112128 has 216 divisors, whose sum is σ = 86590031848320. Its totient is φ = 8298345646080.
The previous prime is 27456996112121. The next prime is 27456996112151. The reversal of 27456996112128 is 82121169965472.
27456996112128 is a `hidden beast` number, since 2 + 7 + 4 + 5 + 6 + 9 + 9 + 611 + 2 + 1 + 2 + 8 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27456996112121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8176125 + ... + 11034627.
Almost surely, 227456996112128 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 27456996112128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43295015924160).
27456996112128 is an abundant number, since it is smaller than the sum of its proper divisors (59133035736192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27456996112128 is a wasteful number, since it uses less digits than its factorization.
27456996112128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2858915 (or 2858898 counting only the distinct ones).
The product of its digits is 26127360, while the sum is 63.
The spelling of 27456996112128 in words is "twenty-seven trillion, four hundred fifty-six billion, nine hundred ninety-six million, one hundred twelve thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •