Base | Representation |
---|---|
bin | 1111100101000111… |
… | …1001110011110101 |
3 | 101210110120210022211 |
4 | 3321101321303311 |
5 | 32031122020041 |
6 | 1530555253421 |
7 | 205432166200 |
oct | 37121716365 |
9 | 11713523284 |
10 | 4182220021 |
11 | 1856832891 |
12 | 98874a271 |
13 | 5185c1c05 |
14 | 2b9628937 |
15 | 19726b481 |
hex | f9479cf5 |
4182220021 has 12 divisors (see below), whose sum is σ = 4866117132. Its totient is φ = 3583960128.
The previous prime is 4182219953. The next prime is 4182220039. The reversal of 4182220021 is 1200222814.
It can be written as a sum of positive squares in 2 ways, for example, as 3734432100 + 447787921 = 61110^2 + 21161^2 .
It is not a de Polignac number, because 4182220021 - 215 = 4182187253 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4182219974 and 4182220001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4182220051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 347521 + ... + 359353.
It is an arithmetic number, because the mean of its divisors is an integer number (405509761).
Almost surely, 24182220021 is an apocalyptic number.
It is an amenable number.
4182220021 is a deficient number, since it is larger than the sum of its proper divisors (683897111).
4182220021 is a wasteful number, since it uses less digits than its factorization.
4182220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19060 (or 19053 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 22.
The square root of 4182220021 is about 64670.0859826241. The cubic root of 4182220021 is about 1611.1487013397.
Adding to 4182220021 its reverse (1200222814), we get a palindrome (5382442835).
The spelling of 4182220021 in words is "four billion, one hundred eighty-two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •