Base | Representation |
---|---|
bin | 10001110001001001011… |
… | …000111111111001011011 |
3 | 11022201121201200100120210 |
4 | 101301021120333321123 |
5 | 130001103003031021 |
6 | 2332530502222203 |
7 | 154133365526421 |
oct | 21611130777133 |
9 | 4281551610523 |
10 | 1221002002011 |
11 | 430907887050 |
12 | 17877b124963 |
13 | 8b1a8750b2c |
14 | 4314d91d111 |
15 | 21b638d0e76 |
hex | 11c4963fe5b |
1221002002011 has 8 divisors (see below), whose sum is σ = 1776002912064. Its totient is φ = 740001213320.
The previous prime is 1221002001971. The next prime is 1221002002037. The reversal of 1221002002011 is 1102002001221.
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 1221002002011 - 231 = 1218854518363 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1221002002061) 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 7 ways as a sum of consecutive naturals, for example, 18500030301 + ... + 18500030366.
It is an arithmetic number, because the mean of its divisors is an integer number (222000364008).
Almost surely, 21221002002011 is an apocalyptic number.
1221002002011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1221002002011 is a deficient number, since it is larger than the sum of its proper divisors (555000910053).
1221002002011 is a wasteful number, since it uses less digits than its factorization.
1221002002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37000060681.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1221002002011 its reverse (1102002001221), we get a palindrome (2323004003232).
The spelling of 1221002002011 in words is "one trillion, two hundred twenty-one billion, two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •