Base | Representation |
---|---|
bin | 11111011010010000101… |
… | …011101101011100000000 |
3 | 21122100110122100212200000 |
4 | 133122100223231130000 |
5 | 240331102221210000 |
6 | 4331333542400000 |
7 | 311642444302200 |
oct | 37322053553400 |
9 | 7570418325600 |
10 | 2158500960000 |
11 | 76246257a010 |
12 | 2aa3b9730000 |
13 | 128713086978 |
14 | 76687270400 |
15 | 3b233060000 |
hex | 1f690aed700 |
2158500960000 has 3240 divisors, whose sum is σ = 10333864404864. Its totient is φ = 444165120000.
The previous prime is 2158500959969. The next prime is 2158500960017. The reversal of 2158500960000 is 690058512.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (3240).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 359 ways as a sum of consecutive naturals, for example, 20956319949 + ... + 20956320051.
Almost surely, 22158500960000 is an apocalyptic number.
2158500960000 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 2158500960000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5166932202432).
2158500960000 is an abundant number, since it is smaller than the sum of its proper divisors (8175363444864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2158500960000 is an equidigital number, since it uses as much as digits as its factorization.
2158500960000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179 (or 131 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 2158500960000 in words is "two trillion, one hundred fifty-eight billion, five hundred million, nine hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •