Base | Representation |
---|---|
bin | 11101101100010001111… |
… | …01101100001000110101 |
3 | 10121112022211220222100122 |
4 | 32312020331230020311 |
5 | 113203340002401401 |
6 | 2100401544221325 |
7 | 133464430312364 |
oct | 16661075541065 |
9 | 3545284828318 |
10 | 1020205122101 |
11 | 363737216210 |
12 | 14588076a845 |
13 | 75288301ca9 |
14 | 37541a857db |
15 | 1b8104ee21b |
hex | ed88f6c235 |
1020205122101 has 16 divisors (see below), whose sum is σ = 1170842731200. Its totient is φ = 880300243200.
The previous prime is 1020205122089. The next prime is 1020205122109. The reversal of 1020205122101 is 1012215020201.
It is not a de Polignac number, because 1020205122101 - 230 = 1019131380277 is a prime.
It is a super-2 number, since 2×10202051221012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1020205122101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020205122109) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27084020 + ... + 27121661.
It is an arithmetic number, because the mean of its divisors is an integer number (73177670700).
Almost surely, 21020205122101 is an apocalyptic number.
1020205122101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1020205122101 is a deficient number, since it is larger than the sum of its proper divisors (150637609099).
1020205122101 is a wasteful number, since it uses less digits than its factorization.
1020205122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54205780.
The product of its (nonzero) digits is 80, while the sum is 17.
The spelling of 1020205122101 in words is "one trillion, twenty billion, two hundred five million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •