Base | Representation |
---|---|
bin | 111110001011110110… |
… | …0000100100010000000 |
3 | 110202200201201202202211 |
4 | 1330113230010202000 |
5 | 4141443100240130 |
6 | 141203103551504 |
7 | 12435165204355 |
oct | 1742754044200 |
9 | 422621652684 |
10 | 133541415040 |
11 | 516a8713720 |
12 | 21a6a8bb594 |
13 | c7927b1aa7 |
14 | 666b96862c |
15 | 3718c01a2a |
hex | 1f17b04880 |
133541415040 has 256 divisors, whose sum is σ = 364215398400. Its totient is φ = 46346629120.
The previous prime is 133541415031. The next prime is 133541415053. The reversal of 133541415040 is 40514145331.
It is a junction number, because it is equal to n+sod(n) for n = 133541414993 and 133541415011.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 135850389 + ... + 135851371.
It is an arithmetic number, because the mean of its divisors is an integer number (1422716400).
Almost surely, 2133541415040 is an apocalyptic number.
133541415040 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 133541415040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182107699200).
133541415040 is an abundant number, since it is smaller than the sum of its proper divisors (230673983360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133541415040 is a wasteful number, since it uses less digits than its factorization.
133541415040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1875 (or 1863 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
The spelling of 133541415040 in words is "one hundred thirty-three billion, five hundred forty-one million, four hundred fifteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •