Base | Representation |
---|---|
bin | 1111101001100110… |
… | …1000001000111011 |
3 | 101211202222000210211 |
4 | 3322121220020323 |
5 | 32100430201021 |
6 | 1532510251551 |
7 | 206051045404 |
oct | 37231501073 |
9 | 11752860724 |
10 | 4201022011 |
11 | 186640501a |
12 | 992ab6bb7 |
13 | 51c475c54 |
14 | 2bbd209ab |
15 | 198c323e1 |
hex | fa66823b |
4201022011 has 8 divisors (see below), whose sum is σ = 4209484160. Its totient is φ = 4192570368.
The previous prime is 4201022003. The next prime is 4201022053. The reversal of 4201022011 is 1102201024.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4201022011 - 23 = 4201022003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4201021982 and 4201022000.
It is not an unprimeable number, because it can be changed into a prime (4201025011) 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, 1560955 + ... + 1563643.
It is an arithmetic number, because the mean of its divisors is an integer number (526185520).
Almost surely, 24201022011 is an apocalyptic number.
4201022011 is a deficient number, since it is larger than the sum of its proper divisors (8462149).
4201022011 is a wasteful number, since it uses less digits than its factorization.
4201022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5253.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 4201022011 is about 64815.2914905117. The cubic root of 4201022011 is about 1613.5595038097.
Adding to 4201022011 its reverse (1102201024), we get a palindrome (5303223035).
The spelling of 4201022011 in words is "four billion, two hundred one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •