Base | Representation |
---|---|
bin | 1101111101010… |
… | …11011010000101 |
3 | 22011022222210121 |
4 | 12332223122011 |
5 | 214434002041 |
6 | 15341421541 |
7 | 2621165662 |
oct | 676533205 |
9 | 264288717 |
10 | 117094021 |
11 | 60107520 |
12 | 3326a8b1 |
13 | 1b34a305 |
14 | 117a0a69 |
15 | a42e7d1 |
hex | 6fab685 |
117094021 has 4 divisors (see below), whose sum is σ = 127738944. Its totient is φ = 106449100.
The previous prime is 117093997. The next prime is 117094051. The reversal of 117094021 is 120490711.
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.
It is a cyclic number.
It is not a de Polignac number, because 117094021 - 211 = 117091973 is a prime.
It is a super-2 number, since 2×1170940212 = 27422019507896882, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117094051) 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, 5322445 + ... + 5322466.
It is an arithmetic number, because the mean of its divisors is an integer number (31934736).
Almost surely, 2117094021 is an apocalyptic number.
117094021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
117094021 is a deficient number, since it is larger than the sum of its proper divisors (10644923).
117094021 is a wasteful number, since it uses less digits than its factorization.
117094021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10644922.
The product of its (nonzero) digits is 504, while the sum is 25.
The square root of 117094021 is about 10820.9990758710. Note that the first 3 decimals coincide. The cubic root of 117094021 is about 489.2283021640.
The spelling of 117094021 in words is "one hundred seventeen million, ninety-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •