Base | Representation |
---|---|
bin | 1110000010100… |
… | …10101010011101 |
3 | 22012121210112221 |
4 | 13001102222131 |
5 | 220122412401 |
6 | 15404225341 |
7 | 2630051206 |
oct | 701225235 |
9 | 265553487 |
10 | 117779101 |
11 | 60535200 |
12 | 3353b251 |
13 | 1b52a09b |
14 | 118dc5ad |
15 | a5177a1 |
hex | 7052a9d |
117779101 has 12 divisors (see below), whose sum is σ = 132622812. Its totient is φ = 104456000.
The previous prime is 117779093. The next prime is 117779147. The reversal of 117779101 is 101977711.
It can be written as a sum of positive squares in 2 ways, for example, as 68062500 + 49716601 = 8250^2 + 7051^2 .
It is not a de Polignac number, because 117779101 - 23 = 117779093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117779191) 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 11 ways as a sum of consecutive naturals, for example, 6910 + ... + 16831.
It is an arithmetic number, because the mean of its divisors is an integer number (11051901).
Almost surely, 2117779101 is an apocalyptic number.
117779101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
117779101 is a deficient number, since it is larger than the sum of its proper divisors (14843711).
117779101 is a wasteful number, since it uses less digits than its factorization.
117779101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23804 (or 23793 counting only the distinct ones).
The product of its (nonzero) digits is 3087, while the sum is 34.
The square root of 117779101 is about 10852.6080275665. The cubic root of 117779101 is about 490.1805540365.
The spelling of 117779101 in words is "one hundred seventeen million, seven hundred seventy-nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •