Base | Representation |
---|---|
bin | 100110010101… |
… | …1101110000101 |
3 | 1101211021210022 |
4 | 1030223232011 |
5 | 20121231041 |
6 | 1554504525 |
7 | 332602322 |
oct | 114535605 |
9 | 41737708 |
10 | 20102021 |
11 | 1038aa45 |
12 | 6895145 |
13 | 421a9b4 |
14 | 2953b49 |
15 | 1b7124b |
hex | 132bb85 |
20102021 has 4 divisors (see below), whose sum is σ = 20116044. Its totient is φ = 20088000.
The previous prime is 20102009. The next prime is 20102029. The reversal of 20102021 is 12020102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 12020102 = 2 ⋅6010051.
It can be written as a sum of positive squares in 2 ways, for example, as 11628100 + 8473921 = 3410^2 + 2911^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102021 - 218 = 19839877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4580 + ... + 7821.
It is an arithmetic number, because the mean of its divisors is an integer number (5029011).
Almost surely, 220102021 is an apocalyptic number.
It is an amenable number.
20102021 is a deficient number, since it is larger than the sum of its proper divisors (14023).
20102021 is a wasteful number, since it uses less digits than its factorization.
20102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14022.
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 20102021 is about 4483.5277405186. The cubic root of 20102021 is about 271.9025250857.
Adding to 20102021 its reverse (12020102), we get a palindrome (32122123).
The spelling of 20102021 in words is "twenty million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •