Base | Representation |
---|---|
bin | 1100110100000111110… |
… | …1101000001000000000 |
3 | 210001020122002001200000 |
4 | 3031001331220020000 |
5 | 12101331400200042 |
6 | 245045134400000 |
7 | 21622344114660 |
oct | 3150175501000 |
9 | 701218061600 |
10 | 220150006272 |
11 | 85401a37149 |
12 | 367bb960000 |
13 | 179b5ac8801 |
14 | a9262941a0 |
15 | 5ad747174c |
hex | 3341f68200 |
220150006272 has 480 divisors, whose sum is σ = 760032104832. Its totient is φ = 62315495424.
The previous prime is 220150006261. The next prime is 220150006277. The reversal of 220150006272 is 272600051022.
220150006272 is a `hidden beast` number, since 2 + 20 + 15 + 0 + 0 + 0 + 627 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (220150006277) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 98411938 + ... + 98414174.
Almost surely, 2220150006272 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 220150006272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (380016052416).
220150006272 is an abundant number, since it is smaller than the sum of its proper divisors (539882098560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220150006272 is an equidigital number, since it uses as much as digits as its factorization.
220150006272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2390 (or 2362 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
Adding to 220150006272 its reverse (272600051022), we get a palindrome (492750057294).
The spelling of 220150006272 in words is "two hundred twenty billion, one hundred fifty million, six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •