Base | Representation |
---|---|
bin | 10011100101000000… |
… | …101001001011001101 |
3 | 2000021001122021112111 |
4 | 103211000221023031 |
5 | 321023114122201 |
6 | 13353554504021 |
7 | 1342642136632 |
oct | 234500511315 |
9 | 60231567474 |
10 | 21022020301 |
11 | 8a08422aa7 |
12 | 40a8295011 |
13 | 1ca0354989 |
14 | 1035d26189 |
15 | 83084bb51 |
hex | 4e50292cd |
21022020301 has 4 divisors (see below), whose sum is σ = 21033080604. Its totient is φ = 21010960000.
The previous prime is 21022020281. The next prime is 21022020389. The reversal of 21022020301 is 10302022012.
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 8399722500 + 12622297801 = 91650^2 + 112349^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21022020301 is a prime.
It is a super-2 number, since 2×210220203012 (a number of 21 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 (21022020101) 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, 5527300 + ... + 5531101.
It is an arithmetic number, because the mean of its divisors is an integer number (5258270151).
Almost surely, 221022020301 is an apocalyptic number.
It is an amenable number.
21022020301 is a deficient number, since it is larger than the sum of its proper divisors (11060303).
21022020301 is a wasteful number, since it uses less digits than its factorization.
21022020301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11060302.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 21022020301 its reverse (10302022012), we get a palindrome (31324042313).
The spelling of 21022020301 in words is "twenty-one billion, twenty-two million, twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •