Base | Representation |
---|---|
bin | 10011100100111001… |
… | …110010001010010101 |
3 | 2000020221020220212111 |
4 | 103210321302022111 |
5 | 321022134101401 |
6 | 13353452151021 |
7 | 1342620640234 |
oct | 234471621225 |
9 | 60227226774 |
10 | 21020222101 |
11 | 8a07404a8a |
12 | 40a7768471 |
13 | 1c9cb75358 |
14 | 10359b8b1b |
15 | 8305e3e51 |
hex | 4e4e72295 |
21020222101 has 8 divisors (see below), whose sum is σ = 23428111680. Its totient is φ = 18742488768.
The previous prime is 21020222099. The next prime is 21020222161. The reversal of 21020222101 is 10122202012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21020222101 - 21 = 21020222099 is a prime.
It is a super-3 number, since 3×210202221013 (a number of 32 digits) contains 333 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 (21020222161) 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 7 ways as a sum of consecutive naturals, for example, 32538721 + ... + 32539366.
It is an arithmetic number, because the mean of its divisors is an integer number (2928513960).
Almost surely, 221020222101 is an apocalyptic number.
It is an amenable number.
21020222101 is a deficient number, since it is larger than the sum of its proper divisors (2407889579).
21020222101 is a wasteful number, since it uses less digits than its factorization.
21020222101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65078123.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 21020222101 its reverse (10122202012), we get a palindrome (31142424113).
The spelling of 21020222101 in words is "twenty-one billion, twenty million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •