Base | Representation |
---|---|
bin | 1001100011110100110000… |
… | …00100010101101111101110 |
3 | 2202102200202202212101201001 |
4 | 10301322120010111233232 |
5 | 10223411301013033402 |
6 | 112413232411110514 |
7 | 4266540522034621 |
oct | 461723004255756 |
9 | 82380682771631 |
10 | 21022121221102 |
11 | 6775482424841 |
12 | 2436289a4243a |
13 | b964ba565201 |
14 | 52969459bdb8 |
15 | 266c786c3187 |
hex | 131e98115bee |
21022121221102 has 4 divisors (see below), whose sum is σ = 31533181831656. Its totient is φ = 10511060610550.
The previous prime is 21022121221081. The next prime is 21022121221151. The reversal of 21022121221102 is 20112212122012.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×210221212211023 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21022121221102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5255530305274 + ... + 5255530305277.
It is an arithmetic number, because the mean of its divisors is an integer number (7883295457914).
Almost surely, 221022121221102 is an apocalyptic number.
21022121221102 is a deficient number, since it is larger than the sum of its proper divisors (10511060610554).
21022121221102 is a wasteful number, since it uses less digits than its factorization.
21022121221102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10511060610553.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21022121221102 its reverse (20112212122012), we get a palindrome (41134333343114).
The spelling of 21022121221102 in words is "twenty-one trillion, twenty-two billion, one hundred twenty-one million, two hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •