Base | Representation |
---|---|
bin | 111100110011011… |
… | …101010001011001 |
3 | 2122002112120120202 |
4 | 330303131101121 |
5 | 4042122402301 |
6 | 245120431545 |
7 | 34164616130 |
oct | 7463352131 |
9 | 2562476522 |
10 | 1020122201 |
11 | 4839179aa |
12 | 2457785b5 |
13 | 133464107 |
14 | 996a8917 |
15 | 5e85866b |
hex | 3ccdd459 |
1020122201 has 8 divisors (see below), whose sum is σ = 1166116224. Its totient is φ = 874193760.
The previous prime is 1020122161. The next prime is 1020122203. The reversal of 1020122201 is 1022210201.
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 1020122201 - 222 = 1015927897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1020122203) 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, 23381 + ... + 50861.
It is an arithmetic number, because the mean of its divisors is an integer number (145764528).
Almost surely, 21020122201 is an apocalyptic number.
It is an amenable number.
1020122201 is a deficient number, since it is larger than the sum of its proper divisors (145994023).
1020122201 is an equidigital number, since it uses as much as digits as its factorization.
1020122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32791.
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 1020122201 is about 31939.3519189103. The cubic root of 1020122201 is about 1006.6629073999.
Adding to 1020122201 its reverse (1022210201), we get a palindrome (2042332402).
It can be divided in two parts, 10201 and 22201, that multiplied together give a square (226472401 = 150492).
The spelling of 1020122201 in words is "one billion, twenty million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •