Base | Representation |
---|---|
bin | 1101101101011… |
… | …10011111001001 |
3 | 22000102002100102 |
4 | 12312232133021 |
5 | 213420300411 |
6 | 15225015145 |
7 | 2564364416 |
oct | 666563711 |
9 | 260362312 |
10 | 115009481 |
11 | 59a13364 |
12 | 326244b5 |
13 | 1aa9a562 |
14 | 113bb10d |
15 | a16bd3b |
hex | 6dae7c9 |
115009481 has 2 divisors, whose sum is σ = 115009482. Its totient is φ = 115009480.
The previous prime is 115009459. The next prime is 115009483. The reversal of 115009481 is 184900511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82973881 + 32035600 = 9109^2 + 5660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115009481 is a prime.
It is a super-2 number, since 2×1150094812 = 26454361439778722, which contains 22 as substring.
Together with 115009483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (115009483) by changing a digit.
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 as a sum of consecutive naturals, namely, 57504740 + 57504741.
It is an arithmetic number, because the mean of its divisors is an integer number (57504741).
Almost surely, 2115009481 is an apocalyptic number.
It is an amenable number.
115009481 is a deficient number, since it is larger than the sum of its proper divisors (1).
115009481 is an equidigital number, since it uses as much as digits as its factorization.
115009481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 29.
The square root of 115009481 is about 10724.2473395572. The cubic root of 115009481 is about 486.3077766765.
Adding to 115009481 its reverse (184900511), we get a palindrome (299909992).
The spelling of 115009481 in words is "one hundred fifteen million, nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •