Base | Representation |
---|---|
bin | 1101111011010… |
… | …01110110011001 |
3 | 22010211100110021 |
4 | 12331221312121 |
5 | 214401403442 |
6 | 15331550441 |
7 | 2616000055 |
oct | 675516631 |
9 | 263740407 |
10 | 116825497 |
11 | 5aa437a8 |
12 | 3315b421 |
13 | 1b285019 |
14 | 11730c65 |
15 | a3c9e67 |
hex | 6f69d99 |
116825497 has 4 divisors (see below), whose sum is σ = 116872756. Its totient is φ = 116778240.
The previous prime is 116825491. The next prime is 116825519. The reversal of 116825497 is 794528611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 794528611 = 601 ⋅1322011.
It can be written as a sum of positive squares in 2 ways, for example, as 103713856 + 13111641 = 10184^2 + 3621^2 .
It is a cyclic number.
It is not a de Polignac number, because 116825497 - 215 = 116792729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116825491) 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 in 3 ways as a sum of consecutive naturals, for example, 19704 + ... + 24937.
It is an arithmetic number, because the mean of its divisors is an integer number (29218189).
Almost surely, 2116825497 is an apocalyptic number.
It is an amenable number.
116825497 is a deficient number, since it is larger than the sum of its proper divisors (47259).
116825497 is an equidigital number, since it uses as much as digits as its factorization.
116825497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47258.
The product of its digits is 120960, while the sum is 43.
The square root of 116825497 is about 10808.5844124011. The cubic root of 116825497 is about 488.8540442586.
The spelling of 116825497 in words is "one hundred sixteen million, eight hundred twenty-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •