Base | Representation |
---|---|
bin | 11101101111101010010… |
… | …01010100101010101101 |
3 | 10121201000100010222002111 |
4 | 32313311021110222231 |
5 | 113221044122023041 |
6 | 2101302021524021 |
7 | 133560416415310 |
oct | 16676511245255 |
9 | 3551010128074 |
10 | 1022020111021 |
11 | 364488788258 |
12 | 1460a8573611 |
13 | 754b733c630 |
14 | 37674b40977 |
15 | 1b8b9a18981 |
hex | edf5254aad |
1022020111021 has 128 divisors (see below), whose sum is σ = 1382659891200. Its totient is φ = 733017600000.
The previous prime is 1022020110973. The next prime is 1022020111027. The reversal of 1022020111021 is 1201110202201.
It is not a de Polignac number, because 1022020111021 - 235 = 987660372653 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 1022020110992 and 1022020111010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022020111027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1263312465 + ... + 1263313273.
It is an arithmetic number, because the mean of its divisors is an integer number (10802030400).
Almost surely, 21022020111021 is an apocalyptic number.
It is an amenable number.
1022020111021 is a deficient number, since it is larger than the sum of its proper divisors (360639780179).
1022020111021 is a wasteful number, since it uses less digits than its factorization.
1022020111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1211.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1022020111021 its reverse (1201110202201), we get a palindrome (2223130313222).
The spelling of 1022020111021 in words is "one trillion, twenty-two billion, twenty million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •