Base | Representation |
---|---|
bin | 1011000111010011001000… |
… | …0001001001111111110011 |
3 | 1121021020000021122010010021 |
4 | 2301310302001021333303 |
5 | 3100203100401333021 |
6 | 41553444502144311 |
7 | 2400603341461504 |
oct | 261646201117763 |
9 | 47236007563107 |
10 | 12220021121011 |
11 | 3991533390600 |
12 | 14543a4422097 |
13 | 6a845c8a0112 |
14 | 303648ac2bab |
15 | 162d0ddd3c41 |
hex | b1d32049ff3 |
12220021121011 has 24 divisors (see below), whose sum is σ = 14187123714960. Its totient is φ = 10488500003520.
The previous prime is 12220021120969. The next prime is 12220021121017. The reversal of 12220021121011 is 11012112002221.
It is a de Polignac number, because none of the positive numbers 2k-12220021121011 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12220021121017) by changing a digit.
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 in 23 ways as a sum of consecutive naturals, for example, 8396980 + ... + 9744193.
It is an arithmetic number, because the mean of its divisors is an integer number (591130154790).
Almost surely, 212220021121011 is an apocalyptic number.
12220021121011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12220021121011 is a deficient number, since it is larger than the sum of its proper divisors (1967102593949).
12220021121011 is a wasteful number, since it uses less digits than its factorization.
12220021121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18141507 (or 18141496 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12220021121011 its reverse (11012112002221), we get a palindrome (23232133123232).
The spelling of 12220021121011 in words is "twelve trillion, two hundred twenty billion, twenty-one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •