Base | Representation |
---|---|
bin | 1000111101100100110… |
… | …1101111110100111000 |
3 | 112201102022011122022210 |
4 | 2033121031233310320 |
5 | 10010311314140000 |
6 | 154422035015120 |
7 | 14060321245440 |
oct | 2173115576470 |
9 | 481368148283 |
10 | 153968115000 |
11 | 5a32aa94737 |
12 | 25a0b73a4a0 |
13 | 116996b8bbb |
14 | 76487a5120 |
15 | 4012157350 |
hex | 23d936fd38 |
153968115000 has 640 divisors, whose sum is σ = 587331993600. Its totient is φ = 32840640000.
The previous prime is 153968114983. The next prime is 153968115011. The reversal of 153968115000 is 511869351.
It is a self number, because there is not a number n which added to its sum of digits gives 153968115000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 141644457 + ... + 141645543.
It is an arithmetic number, because the mean of its divisors is an integer number (917706240).
Almost surely, 2153968115000 is an apocalyptic number.
153968115000 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 153968115000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (293665996800).
153968115000 is an abundant number, since it is smaller than the sum of its proper divisors (433363878600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153968115000 is a wasteful number, since it uses less digits than its factorization.
153968115000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1213 (or 1194 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 39.
The spelling of 153968115000 in words is "one hundred fifty-three billion, nine hundred sixty-eight million, one hundred fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •