Base | Representation |
---|---|
bin | 1101101101011… |
… | …10000011000001 |
3 | 22000101222212202 |
4 | 12312232003001 |
5 | 213420221211 |
6 | 15225002545 |
7 | 2564356235 |
oct | 666560301 |
9 | 260358782 |
10 | 115007681 |
11 | 59a11a78 |
12 | 32623455 |
13 | 1aa997a9 |
14 | 113ba5c5 |
15 | a16b53b |
hex | 6dae0c1 |
115007681 has 4 divisors (see below), whose sum is σ = 115740372. Its totient is φ = 114274992.
The previous prime is 115007677. The next prime is 115007687. The reversal of 115007681 is 186700511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 46117681 + 68890000 = 6791^2 + 8300^2 .
It is a cyclic number.
It is not a de Polignac number, because 115007681 - 22 = 115007677 is a prime.
It is a super-2 number, since 2×1150076812 = 26453533377995522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115007687) 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 3 ways as a sum of consecutive naturals, for example, 366110 + ... + 366423.
It is an arithmetic number, because the mean of its divisors is an integer number (28935093).
Almost surely, 2115007681 is an apocalyptic number.
It is an amenable number.
115007681 is a deficient number, since it is larger than the sum of its proper divisors (732691).
115007681 is an equidigital number, since it uses as much as digits as its factorization.
115007681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 732690.
The product of its (nonzero) digits is 1680, while the sum is 29.
The square root of 115007681 is about 10724.1634172554. The cubic root of 115007681 is about 486.3052396144.
The spelling of 115007681 in words is "one hundred fifteen million, seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •