Base | Representation |
---|---|
bin | 11110011011100110000… |
… | …001000110110011000000 |
3 | 21101220210020111020121100 |
4 | 132123212001012303000 |
5 | 233230301031434040 |
6 | 4240405015254400 |
7 | 304041132351126 |
oct | 36334601066300 |
9 | 7356706436540 |
10 | 2091213155520 |
11 | 736973343645 |
12 | 29935b07a400 |
13 | 12227b805a48 |
14 | 73302943916 |
15 | 395e5ae2b30 |
hex | 1e6e6046cc0 |
2091213155520 has 252 divisors, whose sum is σ = 7640905768704. Its totient is φ = 524853288960.
The previous prime is 2091213155519. The next prime is 2091213155531. The reversal of 2091213155520 is 255513121902.
2091213155520 is a `hidden beast` number, since 2 + 0 + 9 + 121 + 3 + 1 + 5 + 5 + 520 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 423936 + ... + 2088575.
Almost surely, 22091213155520 is an apocalyptic number.
2091213155520 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2091213155520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3820452884352).
2091213155520 is an abundant number, since it is smaller than the sum of its proper divisors (5549692613184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2091213155520 is a wasteful number, since it uses less digits than its factorization.
2091213155520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2512568 (or 2512538 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 2091213155520 in words is "two trillion, ninety-one billion, two hundred thirteen million, one hundred fifty-five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •