Base | Representation |
---|---|
bin | 11101101111101001001… |
… | …10101001001101000101 |
3 | 10121200222201001002200202 |
4 | 32313310212221031011 |
5 | 113221034310120401 |
6 | 2101301055020245 |
7 | 133560246223211 |
oct | 16676446511505 |
9 | 3550881032622 |
10 | 1022011020101 |
11 | 3644836390a5 |
12 | 1460a550a685 |
13 | 754b54a87a6 |
14 | 37673855941 |
15 | 1b8b8d2006b |
hex | edf49a9345 |
1022011020101 has 4 divisors (see below), whose sum is σ = 1022018191104. Its totient is φ = 1022003849100.
The previous prime is 1022011020073. The next prime is 1022011020161. The reversal of 1022011020101 is 1010201102201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1022011020101 - 226 = 1021943911237 is a prime.
It is a super-3 number, since 3×10220110201013 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022011020161) 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, 3367295 + ... + 3658236.
It is an arithmetic number, because the mean of its divisors is an integer number (255504547776).
Almost surely, 21022011020101 is an apocalyptic number.
It is an amenable number.
1022011020101 is a deficient number, since it is larger than the sum of its proper divisors (7171003).
1022011020101 is an equidigital number, since it uses as much as digits as its factorization.
1022011020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7171002.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1022011020101 its reverse (1010201102201), we get a palindrome (2032212122302).
The spelling of 1022011020101 in words is "one trillion, twenty-two billion, eleven million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •