Base | Representation |
---|---|
bin | 110110011001000110… |
… | …0110100110100001101 |
3 | 102011111102201212101022 |
4 | 1230302030310310031 |
5 | 3403204410333403 |
6 | 125354325123525 |
7 | 11303366335610 |
oct | 1546214646415 |
9 | 364442655338 |
10 | 116806339853 |
11 | 455a0151a75 |
12 | 1a77a2595a5 |
13 | b026658438 |
14 | 592112c177 |
15 | 308990ad38 |
hex | 1b32334d0d |
116806339853 has 4 divisors (see below), whose sum is σ = 133492959840. Its totient is φ = 100119719868.
The previous prime is 116806339849. The next prime is 116806339921. The reversal of 116806339853 is 358933608611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 358933608611 = 17 ⋅21113741683.
It is not a de Polignac number, because 116806339853 - 22 = 116806339849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116806339795 and 116806339804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116806339823) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8343309983 + ... + 8343309996.
It is an arithmetic number, because the mean of its divisors is an integer number (33373239960).
Almost surely, 2116806339853 is an apocalyptic number.
It is an amenable number.
116806339853 is a deficient number, since it is larger than the sum of its proper divisors (16686619987).
116806339853 is an equidigital number, since it uses as much as digits as its factorization.
116806339853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16686619986.
The product of its (nonzero) digits is 2799360, while the sum is 53.
The spelling of 116806339853 in words is "one hundred sixteen billion, eight hundred six million, three hundred thirty-nine thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •