Base | Representation |
---|---|
bin | 11010001111010… |
… | …11000100110100 |
3 | 120100012000100202 |
4 | 31013223010310 |
5 | 422322142002 |
6 | 33501500032 |
7 | 5311643300 |
oct | 1507530464 |
9 | 510160322 |
10 | 220115252 |
11 | 103281935 |
12 | 61871618 |
13 | 367ab016 |
14 | 2133ad00 |
15 | 144ce502 |
hex | d1eb134 |
220115252 has 72 divisors (see below), whose sum is σ = 489984768. Its totient is φ = 85881600.
The previous prime is 220115227. The next prime is 220115263. The reversal of 220115252 is 252511022.
It is a happy number.
220115252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 102227 + ... + 104357.
It is an arithmetic number, because the mean of its divisors is an integer number (6805344).
Almost surely, 2220115252 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 220115252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (244992384).
220115252 is an abundant number, since it is smaller than the sum of its proper divisors (269869516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220115252 is a wasteful number, since it uses less digits than its factorization.
220115252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2197 (or 2188 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 220115252 is about 14836.2816096217. The cubic root of 220115252 is about 603.7864726269.
Adding to 220115252 its reverse (252511022), we get a palindrome (472626274).
The spelling of 220115252 in words is "two hundred twenty million, one hundred fifteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •