Base | Representation |
---|---|
bin | 1101111001000… |
… | …00010101101001 |
3 | 22010021001102021 |
4 | 12330200111221 |
5 | 214312240033 |
6 | 15321304441 |
7 | 2613304156 |
oct | 674402551 |
9 | 263231367 |
10 | 116524393 |
11 | 5a858557 |
12 | 33035121 |
13 | 1b1aac5b |
14 | 1169322d |
15 | a36ab2d |
hex | 6f20569 |
116524393 has 4 divisors (see below), whose sum is σ = 116549188. Its totient is φ = 116499600.
The previous prime is 116524363. The next prime is 116524403. The reversal of 116524393 is 393425611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 393425611 = 17 ⋅23142683.
It can be written as a sum of positive squares in 2 ways, for example, as 59552089 + 56972304 = 7717^2 + 7548^2 .
It is a cyclic number.
It is not a de Polignac number, because 116524393 - 29 = 116523881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116524313) 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, 2946 + ... + 15547.
It is an arithmetic number, because the mean of its divisors is an integer number (29137297).
Almost surely, 2116524393 is an apocalyptic number.
It is an amenable number.
116524393 is a deficient number, since it is larger than the sum of its proper divisors (24795).
116524393 is an equidigital number, since it uses as much as digits as its factorization.
116524393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24794.
The product of its digits is 19440, while the sum is 34.
The square root of 116524393 is about 10794.6464972226. The cubic root of 116524393 is about 488.4336949531.
The spelling of 116524393 in words is "one hundred sixteen million, five hundred twenty-four thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •