Base | Representation |
---|---|
bin | 10001110000011010001… |
… | …111111100111000010001 |
3 | 11022122120121110102122012 |
4 | 101300122033330320101 |
5 | 124442443020214301 |
6 | 2332320210352305 |
7 | 154104653141231 |
oct | 21603217747021 |
9 | 4278517412565 |
10 | 1220211101201 |
11 | 4305413a0614 |
12 | 17859a28b695 |
13 | 8b0b09357a1 |
14 | 430b6881cc1 |
15 | 21b19254ebb |
hex | 11c1a3fce11 |
1220211101201 has 4 divisors (see below), whose sum is σ = 1262287346100. Its totient is φ = 1178134856304.
The previous prime is 1220211101173. The next prime is 1220211101203. The reversal of 1220211101201 is 1021011120221.
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 774188814400 + 446022286801 = 879880^2 + 667849^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220211101201 - 210 = 1220211100177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1220211101203) 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, 21038122406 + ... + 21038122463.
It is an arithmetic number, because the mean of its divisors is an integer number (315571836525).
Almost surely, 21220211101201 is an apocalyptic number.
It is an amenable number.
1220211101201 is a deficient number, since it is larger than the sum of its proper divisors (42076244899).
1220211101201 is an equidigital number, since it uses as much as digits as its factorization.
1220211101201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42076244898.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1220211101201 its reverse (1021011120221), we get a palindrome (2241222221422).
The spelling of 1220211101201 in words is "one trillion, two hundred twenty billion, two hundred eleven million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •