Base | Representation |
---|---|
bin | 11101101011111011110… |
… | …11111000110000000101 |
3 | 10121111211221202212212222 |
4 | 32311331323320300011 |
5 | 113203000121200401 |
6 | 2100331334422125 |
7 | 133460022536552 |
oct | 16657573706005 |
9 | 3544757685788 |
10 | 1020020100101 |
11 | 363651833472 |
12 | 14582a801945 |
13 | 75258b90312 |
14 | 37525281a29 |
15 | 1b7ee152c1b |
hex | ed7def8c05 |
1020020100101 has 4 divisors (see below), whose sum is σ = 1020068649600. Its totient is φ = 1019971550604.
The previous prime is 1020020100083. The next prime is 1020020100109. The reversal of 1020020100101 is 1010010200201.
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 1020020100101 - 218 = 1020019837957 is a prime.
It is a super-2 number, since 2×10200201001012 (a number of 25 digits) contains 22 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 (1020020100109) 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, 24243221 + ... + 24285258.
It is an arithmetic number, because the mean of its divisors is an integer number (255017162400).
Almost surely, 21020020100101 is an apocalyptic number.
It is an amenable number.
1020020100101 is a deficient number, since it is larger than the sum of its proper divisors (48549499).
1020020100101 is an equidigital number, since it uses as much as digits as its factorization.
1020020100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48549498.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1020020100101 its reverse (1010010200201), we get a palindrome (2030030300302).
The spelling of 1020020100101 in words is "one trillion, twenty billion, twenty million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •