Base | Representation |
---|---|
bin | 1100110100100000000… |
… | …0000100100011000000 |
3 | 210001111200200211122000 |
4 | 3031020000010203000 |
5 | 12102033313412042 |
6 | 245103153544000 |
7 | 21625014150630 |
oct | 3151000044300 |
9 | 701450624560 |
10 | 220251310272 |
11 | 85454139364 |
12 | 36829875000 |
13 | 17a00aa79c6 |
14 | a9359046c0 |
15 | 5ae12d274c |
hex | 33480048c0 |
220251310272 has 448 divisors, whose sum is σ = 771519513600. Its totient is φ = 60282593280.
The previous prime is 220251310271. The next prime is 220251310283. The reversal of 220251310272 is 272013152022.
It is a tau number, because it is divible by the number of its divisors (448).
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 (220251310271) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 45950308 + ... + 45955100.
Almost surely, 2220251310272 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 220251310272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (385759756800).
220251310272 is an abundant number, since it is smaller than the sum of its proper divisors (551268203328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220251310272 is a wasteful number, since it uses less digits than its factorization.
220251310272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4981 (or 4965 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
Adding to 220251310272 its reverse (272013152022), we get a palindrome (492264462294).
The spelling of 220251310272 in words is "two hundred twenty billion, two hundred fifty-one million, three hundred ten thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •