Base | Representation |
---|---|
bin | 1001000010010111011… |
… | …0010110000111010000 |
3 | 112211201220110112020201 |
4 | 2100211312112013100 |
5 | 10020424434413000 |
6 | 155153404144544 |
7 | 14134222514140 |
oct | 2204566260720 |
9 | 484656415221 |
10 | 155253826000 |
11 | 5a92a812409 |
12 | 2610a238154 |
13 | 11842b90040 |
14 | 772b446920 |
15 | 4089e7396a |
hex | 2425d961d0 |
155253826000 has 960 divisors, whose sum is σ = 520031715840. Its totient is φ = 43495833600.
The previous prime is 155253825989. The next prime is 155253826001. The reversal of 155253826000 is 628352551.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155253826001) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1116933931 + ... + 1116934069.
It is an arithmetic number, because the mean of its divisors is an integer number (541699704).
Almost surely, 2155253826000 is an apocalyptic number.
155253826000 is a gapful number since it is divisible by the number (10) 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 155253826000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260015857920).
155253826000 is an abundant number, since it is smaller than the sum of its proper divisors (364777889840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155253826000 is a wasteful number, since it uses less digits than its factorization.
155253826000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237 (or 202 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 155253826000 in words is "one hundred fifty-five billion, two hundred fifty-three million, eight hundred twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •