Base | Representation |
---|---|
bin | 1101101111010… |
… | …10101110011100 |
3 | 22000212121210220 |
4 | 12313222232130 |
5 | 214001144340 |
6 | 15234201340 |
7 | 2566442652 |
oct | 667525634 |
9 | 260777726 |
10 | 115256220 |
11 | 5a071782 |
12 | 32723250 |
13 | 1ab55961 |
14 | 11442dd2 |
15 | a1b9ed0 |
hex | 6deab9c |
115256220 has 96 divisors (see below), whose sum is σ = 344107008. Its totient is φ = 28756992.
The previous prime is 115256213. The next prime is 115256231. The reversal of 115256220 is 22652511.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63972 + ... + 65748.
It is an arithmetic number, because the mean of its divisors is an integer number (3584448).
Almost surely, 2115256220 is an apocalyptic number.
115256220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115256220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172053504).
115256220 is an abundant number, since it is smaller than the sum of its proper divisors (228850788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115256220 is a wasteful number, since it uses less digits than its factorization.
115256220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1859 (or 1857 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 115256220 is about 10735.7449671646. The cubic root of 115256220 is about 486.6552998742.
The spelling of 115256220 in words is "one hundred fifteen million, two hundred fifty-six thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •