Base | Representation |
---|---|
bin | 1101110000100… |
… | …11001101001001 |
3 | 22001012001020211 |
4 | 12320103031021 |
5 | 214022001100 |
6 | 15241521121 |
7 | 2601033235 |
oct | 670231511 |
9 | 261161224 |
10 | 115422025 |
11 | 5a175304 |
12 | 327a31a1 |
13 | 1abb3274 |
14 | 114875c5 |
15 | a1ee1ba |
hex | 6e13349 |
115422025 has 6 divisors (see below), whose sum is σ = 143123342. Its totient is φ = 92337600.
The previous prime is 115422023. The next prime is 115422031. The reversal of 115422025 is 520224511.
It can be written as a sum of positive squares in 3 ways, for example, as 7033104 + 108388921 = 2652^2 + 10411^2 .
It is not a de Polignac number, because 115422025 - 21 = 115422023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115421987 and 115422005.
It is not an unprimeable number, because it can be changed into a prime (115422023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2308416 + ... + 2308465.
Almost surely, 2115422025 is an apocalyptic number.
It is an amenable number.
115422025 is a deficient number, since it is larger than the sum of its proper divisors (27701317).
115422025 is an equidigital number, since it uses as much as digits as its factorization.
115422025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4616891 (or 4616886 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 115422025 is about 10743.4642923035. The cubic root of 115422025 is about 486.8885518410. Note that the first 3 decimals are identical.
Adding to 115422025 its reverse (520224511), we get a palindrome (635646536).
The spelling of 115422025 in words is "one hundred fifteen million, four hundred twenty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •