Base | Representation |
---|---|
bin | 1111010001110110… |
… | …1011010001010001 |
3 | 101120211112201200122 |
4 | 3310131223101101 |
5 | 31344430420423 |
6 | 1514551400025 |
7 | 203431332020 |
oct | 36435532121 |
9 | 11524481618 |
10 | 4101420113 |
11 | 18151656aa |
12 | 965683015 |
13 | 50494170b |
14 | 2ac9d48b7 |
15 | 19010a8c8 |
hex | f476b451 |
4101420113 has 8 divisors (see below), whose sum is σ = 4687840128. Its totient is φ = 3515125824.
The previous prime is 4101420107. The next prime is 4101420121. The reversal of 4101420113 is 3110241014.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4101420113 - 24 = 4101420097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4101420091 and 4101420100.
It is not an unprimeable number, because it can be changed into a prime (4101420133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53945 + ... + 105417.
It is an arithmetic number, because the mean of its divisors is an integer number (585980016).
Almost surely, 24101420113 is an apocalyptic number.
It is an amenable number.
4101420113 is a deficient number, since it is larger than the sum of its proper divisors (586420015).
4101420113 is a wasteful number, since it uses less digits than its factorization.
4101420113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62863.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 4101420113 is about 64042.3306337301. The cubic root of 4101420113 is about 1600.7054328123.
Adding to 4101420113 its reverse (3110241014), we get a palindrome (7211661127).
The spelling of 4101420113 in words is "four billion, one hundred one million, four hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •