Base | Representation |
---|---|
bin | 11110101000011010000… |
… | …000100101011000100000 |
3 | 21110020022000001102010000 |
4 | 132220122000211120200 |
5 | 233441434401221101 |
6 | 4251002055340000 |
7 | 305036061431310 |
oct | 36503200453040 |
9 | 7406260042100 |
10 | 2104970335776 |
11 | 741792972800 |
12 | 29bb5a381600 |
13 | 123661a174a9 |
14 | 73c49a8d440 |
15 | 39b4d75e486 |
hex | 1ea1a025620 |
2104970335776 has 1440 divisors, whose sum is σ = 8119696628736. Its totient is φ = 523069747200.
The previous prime is 2104970335757. The next prime is 2104970335781. The reversal of 2104970335776 is 6775330794012.
2104970335776 is a `hidden beast` number, since 2 + 1 + 0 + 497 + 0 + 33 + 57 + 76 = 666.
It is a super-2 number, since 2×21049703357762 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 10685128510 + ... + 10685128706.
Almost surely, 22104970335776 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 2104970335776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4059848314368).
2104970335776 is an abundant number, since it is smaller than the sum of its proper divisors (6014726292960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2104970335776 is a wasteful number, since it uses less digits than its factorization.
2104970335776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436 (or 408 counting only the distinct ones).
The product of its (nonzero) digits is 6667920, while the sum is 54.
The spelling of 2104970335776 in words is "two trillion, one hundred four billion, nine hundred seventy million, three hundred thirty-five thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •