Base | Representation |
---|---|
bin | 1100010100100111100001… |
… | …11001111000000011100000 |
3 | 10112221102022021220002122120 |
4 | 12022103300321320003200 |
5 | 12022423013011004231 |
6 | 133344014445504240 |
7 | 5464446241465140 |
oct | 612236071700340 |
9 | 115842267802576 |
10 | 27096695406816 |
11 | 86a770a169732 |
12 | 3057630572080 |
13 | 12172908bbbc9 |
14 | 6996b66a0920 |
15 | 31eca9610d96 |
hex | 18a4f0e780e0 |
27096695406816 has 192 divisors, whose sum is σ = 82395707530752. Its totient is φ = 7637135818752.
The previous prime is 27096695406787. The next prime is 27096695406821. The reversal of 27096695406816 is 61860459669072.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 19334460 + ... + 20688516.
It is an arithmetic number, because the mean of its divisors is an integer number (429144310056).
Almost surely, 227096695406816 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 27096695406816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41197853765376).
27096695406816 is an abundant number, since it is smaller than the sum of its proper divisors (55299012123936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27096695406816 is a wasteful number, since it uses less digits than its factorization.
27096695406816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1354481 (or 1354473 counting only the distinct ones).
The product of its (nonzero) digits is 235146240, while the sum is 69.
The spelling of 27096695406816 in words is "twenty-seven trillion, ninety-six billion, six hundred ninety-five million, four hundred six thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •