Base | Representation |
---|---|
bin | 1001100011110100110000… |
… | …01000000101000000001111 |
3 | 2202102200202211201012000101 |
4 | 10301322120020011000033 |
5 | 10223411301240413403 |
6 | 112413232444111531 |
7 | 4266540533256022 |
oct | 461723010050017 |
9 | 82380684635011 |
10 | 21022122201103 |
11 | 6775482a34061 |
12 | 243628a2355a7 |
13 | b964ba8192aa |
14 | 5296947751b9 |
15 | 266c7881871d |
hex | 131e9820500f |
21022122201103 has 4 divisors (see below), whose sum is σ = 21023039379568. Its totient is φ = 21021205022640.
The previous prime is 21022122201097. The next prime is 21022122201107. The reversal of 21022122201103 is 30110222122012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21022122201103 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 (21022122201107) 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 3 ways as a sum of consecutive naturals, for example, 458554851 + ... + 458600692.
It is an arithmetic number, because the mean of its divisors is an integer number (5255759844892).
Almost surely, 221022122201103 is an apocalyptic number.
21022122201103 is a deficient number, since it is larger than the sum of its proper divisors (917178465).
21022122201103 is an equidigital number, since it uses as much as digits as its factorization.
21022122201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 917178464.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 21022122201103 its reverse (30110222122012), we get a palindrome (51132344323115).
The spelling of 21022122201103 in words is "twenty-one trillion, twenty-two billion, one hundred twenty-two million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •