Base | Representation |
---|---|
bin | 100000000010000011110… |
… | …101101100011100110110 |
3 | 21210102202212021111000000 |
4 | 200002003311230130312 |
5 | 242031112144142200 |
6 | 4403122232332130 |
7 | 315014442012306 |
oct | 40020365543466 |
9 | 7712685244000 |
10 | 2201235146550 |
11 | 7795a1943960 |
12 | 2b6745244046 |
13 | 12c76373239b |
14 | 7877ca0d606 |
15 | 3c3d4ad1300 |
hex | 20083d6c736 |
2201235146550 has 336 divisors, whose sum is σ = 6711785886960. Its totient is φ = 532430496000.
The previous prime is 2201235146531. The next prime is 2201235146557. The reversal of 2201235146550 is 556415321022.
2201235146550 is a `hidden beast` number, since 2 + 2 + 0 + 12 + 3 + 51 + 46 + 550 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201235146557) by changing a digit.
It is a polite number, since it can be written in 167 ways as a sum of consecutive naturals, for example, 184831996 + ... + 184843904.
It is an arithmetic number, because the mean of its divisors is an integer number (19975553235).
Almost surely, 22201235146550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2201235146550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3355892943480).
2201235146550 is an abundant number, since it is smaller than the sum of its proper divisors (4510550740410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201235146550 is a wasteful number, since it uses less digits than its factorization.
2201235146550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12411 (or 12391 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 2201235146550 in words is "two trillion, two hundred one billion, two hundred thirty-five million, one hundred forty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •