Base | Representation |
---|---|
bin | 1111010001110110… |
… | …1011101010010101 |
3 | 101120211112210220001 |
4 | 3310131223222111 |
5 | 31344430443332 |
6 | 1514551411301 |
7 | 203431336501 |
oct | 36435535225 |
9 | 11524483801 |
10 | 4101421717 |
11 | 1815166928 |
12 | 965683b31 |
13 | 504942373 |
14 | 2ac9d5301 |
15 | 19010b0e7 |
hex | f476ba95 |
4101421717 has 4 divisors (see below), whose sum is σ = 4342681836. Its totient is φ = 3860161600.
The previous prime is 4101421631. The next prime is 4101421733. The reversal of 4101421717 is 7171241014.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1613307556 + 2488114161 = 40166^2 + 49881^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4101421717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4101421777) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 120630034 + ... + 120630067.
It is an arithmetic number, because the mean of its divisors is an integer number (1085670459).
Almost surely, 24101421717 is an apocalyptic number.
It is an amenable number.
4101421717 is a deficient number, since it is larger than the sum of its proper divisors (241260119).
4101421717 is a wasteful number, since it uses less digits than its factorization.
4101421717 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241260118.
The product of its (nonzero) digits is 1568, while the sum is 28.
The square root of 4101421717 is about 64042.3431566959. The cubic root of 4101421717 is about 1600.7056414824.
The spelling of 4101421717 in words is "four billion, one hundred one million, four hundred twenty-one thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •