Base | Representation |
---|---|
bin | 11110010001010101101110… |
… | …110100011100001011000000 |
3 | 122110101101102220221112121021 |
4 | 132101111232310130023000 |
5 | 114422222300342433002 |
6 | 1151052234314435224 |
7 | 40020352604533342 |
oct | 3621255664341300 |
9 | 573341386845537 |
10 | 133132960514752 |
11 | 3946940a494640 |
12 | 12b22087132b14 |
13 | 59394cc427993 |
14 | 24c3953809292 |
15 | 105d1619e5737 |
hex | 79156ed1c2c0 |
133132960514752 has 224 divisors, whose sum is σ = 302811679872000. Its totient is φ = 57517242531840.
The previous prime is 133132960514707. The next prime is 133132960514753. The reversal of 133132960514752 is 257415069231331.
It is a self number, because there is not a number n which added to its sum of digits gives 133132960514752.
It is not an unprimeable number, because it can be changed into a prime (133132960514753) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 543412699 + ... + 543657637.
Almost surely, 2133132960514752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133132960514752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151405839936000).
133132960514752 is an abundant number, since it is smaller than the sum of its proper divisors (169678719357248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133132960514752 is a wasteful number, since it uses less digits than its factorization.
133132960514752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245407 (or 245397 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 52.
The spelling of 133132960514752 in words is "one hundred thirty-three trillion, one hundred thirty-two billion, nine hundred sixty million, five hundred fourteen thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •