Base | Representation |
---|---|
bin | 1011000110110001100110… |
… | …0100011111101111011001 |
3 | 1121020100210001100121201021 |
4 | 2301230121210133233121 |
5 | 3100031132340120441 |
6 | 41545355434522441 |
7 | 2400134325050350 |
oct | 261543144375731 |
9 | 47210701317637 |
10 | 12211021020121 |
11 | 39887350305a0 |
12 | 14526b2296421 |
13 | 6a76570b5c31 |
14 | 303033682997 |
15 | 162983bd73d1 |
hex | b1b1991fbd9 |
12211021020121 has 128 divisors (see below), whose sum is σ = 16305413529600. Its totient is φ = 8869222656000.
The previous prime is 12211021020109. The next prime is 12211021020137. The reversal of 12211021020121 is 12102012011221.
It is not a de Polignac number, because 12211021020121 - 29 = 12211021019609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12211021020095 and 12211021020104.
It is not an unprimeable number, because it can be changed into a prime (12211021020181) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2253368950 + ... + 2253374368.
It is an arithmetic number, because the mean of its divisors is an integer number (127386043200).
Almost surely, 212211021020121 is an apocalyptic number.
12211021020121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12211021020121 is a deficient number, since it is larger than the sum of its proper divisors (4094392509479).
12211021020121 is a wasteful number, since it uses less digits than its factorization.
12211021020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5831.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12211021020121 its reverse (12102012011221), we get a palindrome (24313033031342).
The spelling of 12211021020121 in words is "twelve trillion, two hundred eleven billion, twenty-one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •