Base | Representation |
---|---|
bin | 10010110100101011… |
… | …001111000110010101 |
3 | 1221011112202100220002 |
4 | 102310223033012111 |
5 | 312343020231401 |
6 | 13141310021045 |
7 | 1313564350631 |
oct | 226453170625 |
9 | 57145670802 |
10 | 20211102101 |
11 | 8631705173 |
12 | 3b007a7785 |
13 | 1ba134b318 |
14 | d9a357dc1 |
15 | 7d4569a6b |
hex | 4b4acf195 |
20211102101 has 4 divisors (see below), whose sum is σ = 20225738604. Its totient is φ = 20196465600.
The previous prime is 20211102083. The next prime is 20211102113. The reversal of 20211102101 is 10120111202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13776655876 + 6434446225 = 117374^2 + 80215^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20211102101 is a prime.
It is a super-2 number, since 2×202111021012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20211102701) 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, 7316180 + ... + 7318941.
It is an arithmetic number, because the mean of its divisors is an integer number (5056434651).
Almost surely, 220211102101 is an apocalyptic number.
It is an amenable number.
20211102101 is a deficient number, since it is larger than the sum of its proper divisors (14636503).
20211102101 is a wasteful number, since it uses less digits than its factorization.
20211102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14636502.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20211102101 its reverse (10120111202), we get a palindrome (30331213303).
The spelling of 20211102101 in words is "twenty billion, two hundred eleven million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •