Base | Representation |
---|---|
bin | 10001110001001111010… |
… | …111001110010011000001 |
3 | 11022201212201012221101110 |
4 | 101301033113032103001 |
5 | 130001304130400001 |
6 | 2332544441553533 |
7 | 154136023305015 |
oct | 21611727162301 |
9 | 4281781187343 |
10 | 1221102200001 |
11 | 4309593a3302 |
12 | 1787a87a58a9 |
13 | 8b1c3433798 |
14 | 4315cd62545 |
15 | 21b6c5c43d6 |
hex | 11c4f5ce4c1 |
1221102200001 has 4 divisors (see below), whose sum is σ = 1628136266672. Its totient is φ = 814068133332.
The previous prime is 1221102199949. The next prime is 1221102200083. The reversal of 1221102200001 is 1000022011221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-1221102200001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1221102200001.
It is not an unprimeable number, because it can be changed into a prime (1221102270001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 203517033331 + ... + 203517033336.
It is an arithmetic number, because the mean of its divisors is an integer number (407034066668).
Almost surely, 21221102200001 is an apocalyptic number.
It is an amenable number.
1221102200001 is a deficient number, since it is larger than the sum of its proper divisors (407034066671).
1221102200001 is an equidigital number, since it uses as much as digits as its factorization.
1221102200001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407034066670.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1221102200001 its reverse (1000022011221), we get a palindrome (2221124211222).
The spelling of 1221102200001 in words is "one trillion, two hundred twenty-one billion, one hundred two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •