Base | Representation |
---|---|
bin | 110110100000111101… |
… | …1001000010100110001 |
3 | 102012011211010010112010 |
4 | 1231001323020110301 |
5 | 3404224423333000 |
6 | 125440431153133 |
7 | 11313051512451 |
oct | 1550173102461 |
9 | 365154103463 |
10 | 117070136625 |
11 | 45716049432 |
12 | 1a8326757a9 |
13 | b0691bb8c0 |
14 | 5948199d61 |
15 | 30a2b67d50 |
hex | 1b41ec8531 |
117070136625 has 128 divisors (see below), whose sum is σ = 224435667456. Its totient is φ = 53681356800.
The previous prime is 117070136567. The next prime is 117070136629. The reversal of 117070136625 is 526631070711.
It is not a de Polignac number, because 117070136625 - 28 = 117070136369 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (117070136629) 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 127 ways as a sum of consecutive naturals, for example, 8031594 + ... + 8046156.
It is an arithmetic number, because the mean of its divisors is an integer number (1753403652).
Almost surely, 2117070136625 is an apocalyptic number.
117070136625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
117070136625 is a deficient number, since it is larger than the sum of its proper divisors (107365530831).
117070136625 is a wasteful number, since it uses less digits than its factorization.
117070136625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14708 (or 14698 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 39.
The spelling of 117070136625 in words is "one hundred seventeen billion, seventy million, one hundred thirty-six thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •