Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …00000100011001110110 |
3 | 10120122121201220121101011 |
4 | 32231211200010121312 |
5 | 113031032134020042 |
6 | 2052242320022434 |
7 | 133021011035251 |
oct | 16554540043166 |
9 | 3518551817334 |
10 | 1011020220022 |
11 | 35a85361434a |
12 | 143b38761a1a |
13 | 744534527a7 |
14 | 36d0dc9c098 |
15 | 1b473e9ba17 |
hex | eb65804676 |
1011020220022 has 8 divisors (see below), whose sum is σ = 1519062102000. Its totient is φ = 504666186024.
The previous prime is 1011020219947. The next prime is 1011020220029. The reversal of 1011020220022 is 2200220201101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1011020219984 and 1011020220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011020220029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 421960497 + ... + 421962892.
It is an arithmetic number, because the mean of its divisors is an integer number (189882762750).
Almost surely, 21011020220022 is an apocalyptic number.
1011020220022 is a deficient number, since it is larger than the sum of its proper divisors (508041881978).
1011020220022 is an equidigital number, since it uses as much as digits as its factorization.
1011020220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843923990.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1011020220022 its reverse (2200220201101), we get a palindrome (3211240421123).
The spelling of 1011020220022 in words is "one trillion, eleven billion, twenty million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •