Base | Representation |
---|---|
bin | 1101110100010… |
… | …01101110100101 |
3 | 22002002201012010 |
4 | 12322021232211 |
5 | 214133014433 |
6 | 15300144433 |
7 | 2605124502 |
oct | 672115645 |
9 | 262081163 |
10 | 115907493 |
11 | 5a477019 |
12 | 32998119 |
13 | 1b023220 |
14 | 115724a9 |
15 | a297e63 |
hex | 6e89ba5 |
115907493 has 8 divisors (see below), whose sum is σ = 166431328. Its totient is φ = 71327664.
The previous prime is 115907483. The next prime is 115907497. The reversal of 115907493 is 394709511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115907493 - 29 = 115906981 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 2971987 = 115907493 / (1 + 1 + 5 + 9 + 0 + 7 + 4 + 9 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115907497) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1485955 + ... + 1486032.
It is an arithmetic number, because the mean of its divisors is an integer number (20803916).
Almost surely, 2115907493 is an apocalyptic number.
115907493 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
115907493 is a deficient number, since it is larger than the sum of its proper divisors (50523835).
115907493 is a wasteful number, since it uses less digits than its factorization.
115907493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2972003.
The product of its (nonzero) digits is 34020, while the sum is 39.
The square root of 115907493 is about 10766.0342280712. The cubic root of 115907493 is about 487.5702189451.
The spelling of 115907493 in words is "one hundred fifteen million, nine hundred seven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •