Base | Representation |
---|---|
bin | 10001110000010100111… |
… | …001000011000101000001 |
3 | 11022122100100022112201221 |
4 | 101300110321003011001 |
5 | 124442302012224301 |
6 | 2332303235555041 |
7 | 154102512114244 |
oct | 21602471030501 |
9 | 4278310275657 |
10 | 1220121211201 |
11 | 4304a5684962 |
12 | 17857415ba81 |
13 | 8b098121939 |
14 | 430a896325b |
15 | 21b113eada1 |
hex | 11c14e43141 |
1220121211201 has 4 divisors (see below), whose sum is σ = 1291893047172. Its totient is φ = 1148349375232.
The previous prime is 1220121211163. The next prime is 1220121211327. The reversal of 1220121211201 is 1021121210221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 855256889601 + 364864321600 = 924801^2 + 604040^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220121211201 - 215 = 1220121178433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1220121241201) 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, 35885917960 + ... + 35885917993.
It is an arithmetic number, because the mean of its divisors is an integer number (322973261793).
Almost surely, 21220121211201 is an apocalyptic number.
It is an amenable number.
1220121211201 is a deficient number, since it is larger than the sum of its proper divisors (71771835971).
1220121211201 is an equidigital number, since it uses as much as digits as its factorization.
1220121211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71771835970.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1220121211201 its reverse (1021121210221), we get a palindrome (2241242421422).
The spelling of 1220121211201 in words is "one trillion, two hundred twenty billion, one hundred twenty-one million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •