Base | Representation |
---|---|
bin | 1101111001111… |
… | …01101110111001 |
3 | 22010111011120112 |
4 | 12330331232321 |
5 | 214330113133 |
6 | 15324034105 |
7 | 2614315166 |
oct | 674755671 |
9 | 263434515 |
10 | 116644793 |
11 | 5a92aa61 |
12 | 33092935 |
13 | 1b2209b5 |
14 | 116c506d |
15 | a391648 |
hex | 6f3dbb9 |
116644793 has 2 divisors, whose sum is σ = 116644794. Its totient is φ = 116644792.
The previous prime is 116644777. The next prime is 116644807. The reversal of 116644793 is 397446611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62283664 + 54361129 = 7892^2 + 7373^2 .
It is an emirp because it is prime and its reverse (397446611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116644793 - 24 = 116644777 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 116644793.
It is not a weakly prime, because it can be changed into another prime (116644763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58322396 + 58322397.
It is an arithmetic number, because the mean of its divisors is an integer number (58322397).
Almost surely, 2116644793 is an apocalyptic number.
It is an amenable number.
116644793 is a deficient number, since it is larger than the sum of its proper divisors (1).
116644793 is an equidigital number, since it uses as much as digits as its factorization.
116644793 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108864, while the sum is 41.
The square root of 116644793 is about 10800.2218958686. The cubic root of 116644793 is about 488.6018633870.
The spelling of 116644793 in words is "one hundred sixteen million, six hundred forty-four thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •