Base | Representation |
---|---|
bin | 1101110010001… |
… | …00000010001011 |
3 | 22001120012121022 |
4 | 12321010002023 |
5 | 214044401102 |
6 | 15250103055 |
7 | 2602525313 |
oct | 671040213 |
9 | 261505538 |
10 | 115622027 |
11 | 5a2a15a4 |
12 | 3287aa8b |
13 | 1ac53301 |
14 | 114da443 |
15 | a23d5a2 |
hex | 6e4408b |
115622027 has 4 divisors (see below), whose sum is σ = 115873296. Its totient is φ = 115370760.
The previous prime is 115621997. The next prime is 115622051. The reversal of 115622027 is 720226511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 720226511 = 59 ⋅12207229.
It is a cyclic number.
It is not a de Polignac number, because 115622027 - 28 = 115621771 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115621987 and 115622005.
It is not an unprimeable number, because it can be changed into a prime (115622057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 124943 + ... + 125864.
It is an arithmetic number, because the mean of its divisors is an integer number (28968324).
Almost surely, 2115622027 is an apocalyptic number.
115622027 is a deficient number, since it is larger than the sum of its proper divisors (251269).
115622027 is an equidigital number, since it uses as much as digits as its factorization.
115622027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251268.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 115622027 is about 10752.7683412226. The cubic root of 115622027 is about 487.1696145835.
Adding to 115622027 its reverse (720226511), we get a palindrome (835848538).
The spelling of 115622027 in words is "one hundred fifteen million, six hundred twenty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •