Base | Representation |
---|---|
bin | 1101101110100… |
… | …01000101110100 |
3 | 22000200021210000 |
4 | 12313101011310 |
5 | 213434314340 |
6 | 15232031300 |
7 | 2565524562 |
oct | 667210564 |
9 | 260607700 |
10 | 115151220 |
11 | 59aaa8a8 |
12 | 32692530 |
13 | 1ab19c22 |
14 | 11416a32 |
15 | a198d30 |
hex | 6dd1174 |
115151220 has 60 divisors (see below), whose sum is σ = 361238724. Its totient is φ = 30706560.
The previous prime is 115151213. The next prime is 115151233. The reversal of 115151220 is 22151511.
115151220 is a `hidden beast` number, since 1 + 151 + 512 + 2 + 0 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 68856804 + 46294416 = 8298^2 + 6804^2 .
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 115151193 and 115151202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 33921 + ... + 37160.
Almost surely, 2115151220 is an apocalyptic number.
115151220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115151220 is an abundant number, since it is smaller than the sum of its proper divisors (246087504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115151220 is a wasteful number, since it uses less digits than its factorization.
115151220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71102 (or 71091 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
The square root of 115151220 is about 10730.8536473106. The cubic root of 115151220 is about 486.5074717524.
The spelling of 115151220 in words is "one hundred fifteen million, one hundred fifty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •