Base | Representation |
---|---|
bin | 1101111101000… |
… | …10111110010011 |
3 | 22011021020102010 |
4 | 12332202332103 |
5 | 214431400400 |
6 | 15340554003 |
7 | 2620663161 |
oct | 676427623 |
9 | 264236363 |
10 | 117059475 |
11 | 60093575 |
12 | 33252903 |
13 | 1b337680 |
14 | 11792231 |
15 | a424450 |
hex | 6fa2f93 |
117059475 has 96 divisors (see below), whose sum is σ = 224985600. Its totient is φ = 53222400.
The previous prime is 117059473. The next prime is 117059477. The reversal of 117059475 is 574950711.
It is an interprime number because it is at equal distance from previous prime (117059473) and next prime (117059477).
It is not a de Polignac number, because 117059475 - 21 = 117059473 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117059473) 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 95 ways as a sum of consecutive naturals, for example, 1315231 + ... + 1315319.
It is an arithmetic number, because the mean of its divisors is an integer number (2343600).
Almost surely, 2117059475 is an apocalyptic number.
117059475 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
117059475 is a deficient number, since it is larger than the sum of its proper divisors (107926125).
117059475 is a wasteful number, since it uses less digits than its factorization.
117059475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205 (or 200 counting only the distinct ones).
The product of its (nonzero) digits is 44100, while the sum is 39.
The square root of 117059475 is about 10819.4027099466. The cubic root of 117059475 is about 489.1801854366.
The spelling of 117059475 in words is "one hundred seventeen million, fifty-nine thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •