Base | Representation |
---|---|
bin | 111010010111111010001… |
… | …100101010010010100101 |
3 | 112012111010111202220112212 |
4 | 322113322030222102211 |
5 | 1011210322420010432 |
6 | 12310451312453205 |
7 | 562546166226503 |
oct | 72277214522245 |
9 | 15174114686485 |
10 | 4011402110117 |
11 | 1307253a06776 |
12 | 54952a54a205 |
13 | 231373122c5c |
14 | dc21d7a3673 |
15 | 6e52bec82b2 |
hex | 3a5fa32a4a5 |
4011402110117 has 2 divisors, whose sum is σ = 4011402110118. Its totient is φ = 4011402110116.
The previous prime is 4011402110083. The next prime is 4011402110141. The reversal of 4011402110117 is 7110112041104.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2438763215716 + 1572638894401 = 1561654^2 + 1254049^2 .
It is a cyclic number.
It is not a de Polignac number, because 4011402110117 - 236 = 3942682633381 is a prime.
It is a super-2 number, since 2×40114021101172 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4011402110092 and 4011402110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4011402110197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2005701055058 + 2005701055059.
It is an arithmetic number, because the mean of its divisors is an integer number (2005701055059).
Almost surely, 24011402110117 is an apocalyptic number.
It is an amenable number.
4011402110117 is a deficient number, since it is larger than the sum of its proper divisors (1).
4011402110117 is an equidigital number, since it uses as much as digits as its factorization.
4011402110117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 23.
The spelling of 4011402110117 in words is "four trillion, eleven billion, four hundred two million, one hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •