Base | Representation |
---|---|
bin | 1101111100110… |
… | …01010101100011 |
3 | 22011012020021012 |
4 | 12332121111203 |
5 | 214424120003 |
6 | 15340051135 |
7 | 2620440122 |
oct | 676312543 |
9 | 264166235 |
10 | 117020003 |
11 | 60066951 |
12 | 33233aab |
13 | 1b322709 |
14 | 11781ab9 |
15 | a4178d8 |
hex | 6f99563 |
117020003 has 4 divisors (see below), whose sum is σ = 117064920. Its totient is φ = 116975088.
The previous prime is 117019963. The next prime is 117020039. The reversal of 117020003 is 300020711.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 300020711 = 347 ⋅864613.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-117020003 is a prime.
It is a super-2 number, since 2×1170200032 = 27387362204240018, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 117020003.
It is not an unprimeable number, because it can be changed into a prime (117020303) 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, 18293 + ... + 23846.
It is an arithmetic number, because the mean of its divisors is an integer number (29266230).
Almost surely, 2117020003 is an apocalyptic number.
117020003 is a deficient number, since it is larger than the sum of its proper divisors (44917).
117020003 is an equidigital number, since it uses as much as digits as its factorization.
117020003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44916.
The product of its (nonzero) digits is 42, while the sum is 14.
The square root of 117020003 is about 10817.5784258770. The cubic root of 117020003 is about 489.1251960363.
Adding to 117020003 its reverse (300020711), we get a palindrome (417040714).
The spelling of 117020003 in words is "one hundred seventeen million, twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •