Base | Representation |
---|---|
bin | 11101101100010011111… |
… | …10000100111101111110 |
3 | 10121112101000200111212212 |
4 | 32312021332010331332 |
5 | 113203403313013042 |
6 | 2100403350100422 |
7 | 133465023632150 |
oct | 16661176047576 |
9 | 3545330614785 |
10 | 1020222001022 |
11 | 3637457a4634 |
12 | 14588634a712 |
13 | 7528b961913 |
14 | 37543ddaad0 |
15 | 1b811c35482 |
hex | ed89f84f7e |
1020222001022 has 8 divisors (see below), whose sum is σ = 1748952001776. Its totient is φ = 437238000432.
The previous prime is 1020222000949. The next prime is 1020222001027. The reversal of 1020222001022 is 2201002220201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 72873000073 = 1020222001022 / (1 + 0 + 2 + 0 + 2 + 2 + 2 + 0 + 0 + 1 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1020222000988 and 1020222001006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020222001027) 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, 36436500023 + ... + 36436500050.
It is an arithmetic number, because the mean of its divisors is an integer number (218619000222).
Almost surely, 21020222001022 is an apocalyptic number.
1020222001022 is a deficient number, since it is larger than the sum of its proper divisors (728730000754).
1020222001022 is an equidigital number, since it uses as much as digits as its factorization.
1020222001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72873000082.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 1020222001022 its reverse (2201002220201), we get a palindrome (3221224221223).
The spelling of 1020222001022 in words is "one trillion, twenty billion, two hundred twenty-two million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •