Base | Representation |
---|---|
bin | 1011110000100101100… |
… | …1010110001000010101 |
3 | 201022110012100022100210 |
4 | 2330021121112020111 |
5 | 11302214400231401 |
6 | 232450205200033 |
7 | 20411162014650 |
oct | 2741131261025 |
9 | 638405308323 |
10 | 202021102101 |
11 | 78749711115 |
12 | 331a0560019 |
13 | 16086c74490 |
14 | 9ac66b0897 |
15 | 53c5b044d6 |
hex | 2f09656215 |
202021102101 has 16 divisors (see below), whose sum is σ = 331521809024. Its totient is φ = 106560581184.
The previous prime is 202021102099. The next prime is 202021102121. The reversal of 202021102101 is 101201120202.
It is not a de Polignac number, because 202021102101 - 21 = 202021102099 is a prime.
It is a super-2 number, since 2×2020211021012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202021102121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 370001746 + ... + 370002291.
It is an arithmetic number, because the mean of its divisors is an integer number (20720113064).
Almost surely, 2202021102101 is an apocalyptic number.
202021102101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
202021102101 is a deficient number, since it is larger than the sum of its proper divisors (129500706923).
202021102101 is a wasteful number, since it uses less digits than its factorization.
202021102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740004060.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 202021102101 its reverse (101201120202), we get a palindrome (303222222303).
The spelling of 202021102101 in words is "two hundred two billion, twenty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •