Base | Representation |
---|---|
bin | 11101000110110100101… |
… | …100010010100011100000 |
3 | 21002012211202210222210000 |
4 | 131012310230102203200 |
5 | 230232342433124411 |
6 | 4130513013140000 |
7 | 264336414354306 |
oct | 35066454224340 |
9 | 7065752728700 |
10 | 2000191301856 |
11 | 7013049327a0 |
12 | 28379802a600 |
13 | 116804094537 |
14 | 6cb4a04a276 |
15 | 37069bb9956 |
hex | 1d1b4b128e0 |
2000191301856 has 240 divisors, whose sum is σ = 6420676656240. Its totient is φ = 605797816320.
The previous prime is 2000191301837. The next prime is 2000191301869. The reversal of 2000191301856 is 6581031910002.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2000191301856.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 56920900 + ... + 56956028.
It is an arithmetic number, because the mean of its divisors is an integer number (26752819401).
Almost surely, 22000191301856 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 2000191301856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3210338328120).
2000191301856 is an abundant number, since it is smaller than the sum of its proper divisors (4420485354384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000191301856 is a wasteful number, since it uses less digits than its factorization.
2000191301856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37159 (or 37142 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The spelling of 2000191301856 in words is "two trillion, one hundred ninety-one million, three hundred one thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •