Base | Representation |
---|---|
bin | 11101101100000111110… |
… | …01110100100100110001 |
3 | 10121112002221011121022111 |
4 | 32312003321310210301 |
5 | 113203201234101001 |
6 | 2100345312405321 |
7 | 133462346550256 |
oct | 16660371644461 |
9 | 3545087147274 |
10 | 1020120222001 |
11 | 3636a32a8541 |
12 | 145858246841 |
13 | 7527384744a |
14 | 375346a542d |
15 | 1b807d2d851 |
hex | ed83e74931 |
1020120222001 has 4 divisors (see below), whose sum is σ = 1020491312500. Its totient is φ = 1019749131504.
The previous prime is 1020120221993. The next prime is 1020120222031. The reversal of 1020120222001 is 1002220210201.
It is a happy number.
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 172431732001 + 847688490000 = 415249^2 + 920700^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020120222001 - 23 = 1020120221993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020120222031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 185541126 + ... + 185546623.
It is an arithmetic number, because the mean of its divisors is an integer number (255122828125).
Almost surely, 21020120222001 is an apocalyptic number.
It is an amenable number.
1020120222001 is a deficient number, since it is larger than the sum of its proper divisors (371090499).
1020120222001 is an equidigital number, since it uses as much as digits as its factorization.
1020120222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 371090498.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1020120222001 its reverse (1002220210201), we get a palindrome (2022340432202).
The spelling of 1020120222001 in words is "one trillion, twenty billion, one hundred twenty million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •