Base | Representation |
---|---|
bin | 1110111001101011… |
… | …0011000001000101 |
3 | 101022202201011100120 |
4 | 3232122303001011 |
5 | 31143000031432 |
6 | 1500525532153 |
7 | 201060312516 |
oct | 35632630105 |
9 | 11282634316 |
10 | 4000002117 |
11 | 1772995881 |
12 | 937714059 |
13 | 4b9922677 |
14 | 29d354a0d |
15 | 186275c2c |
hex | ee6b3045 |
4000002117 has 4 divisors (see below), whose sum is σ = 5333336160. Its totient is φ = 2666668076.
The previous prime is 4000002091. The next prime is 4000002121. The reversal of 4000002117 is 7112000004.
4000002117 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
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 4000002117 - 218 = 3999739973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4000002096 and 4000002105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4000002817) 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, 666667017 + ... + 666667022.
It is an arithmetic number, because the mean of its divisors is an integer number (1333334040).
Almost surely, 24000002117 is an apocalyptic number.
It is an amenable number.
4000002117 is a deficient number, since it is larger than the sum of its proper divisors (1333334043).
4000002117 is a wasteful number, since it uses less digits than its factorization.
4000002117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1333334042.
The product of its (nonzero) digits is 56, while the sum is 15.
The square root of 4000002117 is about 63245.5699397199. The cubic root of 4000002117 is about 1587.4013320122.
The spelling of 4000002117 in words is "four billion, two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •