Base | Representation |
---|---|
bin | 11111011001011101101… |
… | …101010010110000001110 |
3 | 21122021021001010001020010 |
4 | 133121131231102300032 |
5 | 240322324302040344 |
6 | 4331113032134050 |
7 | 311612321105460 |
oct | 37313555226016 |
9 | 7567231101203 |
10 | 2157645736974 |
11 | 762063850322 |
12 | 2aa1bb237326 |
13 | 128607b3a240 |
14 | 7660584c130 |
15 | 3b1d2e2a8b9 |
hex | 1f65db52c0e |
2157645736974 has 128 divisors (see below), whose sum is σ = 5606781788160. Its totient is φ = 537544957824.
The previous prime is 2157645736969. The next prime is 2157645737003. The reversal of 2157645736974 is 4796375467512.
It is a super-3 number, since 3×21576457369743 (a number of 38 digits) contains 333 as substring.
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, 3300087 + ... + 3899469.
It is an arithmetic number, because the mean of its divisors is an integer number (43802982720).
Almost surely, 22157645736974 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2157645736974, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2803390894080).
2157645736974 is an abundant number, since it is smaller than the sum of its proper divisors (3449136051186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2157645736974 is a wasteful number, since it uses less digits than its factorization.
2157645736974 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 599774.
The product of its digits is 266716800, while the sum is 66.
The spelling of 2157645736974 in words is "two trillion, one hundred fifty-seven billion, six hundred forty-five million, seven hundred thirty-six thousand, nine hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •