Base | Representation |
---|---|
bin | 10001110000100110010… |
… | …010001011010010011101 |
3 | 11022200002200101111221122 |
4 | 101300212102023102131 |
5 | 124443401212323401 |
6 | 2332352222140325 |
7 | 154112654301644 |
oct | 21604622132235 |
9 | 4280080344848 |
10 | 1220413011101 |
11 | 4306353684a9 |
12 | 178635a216a5 |
13 | 8b11370b1bb |
14 | 430d560035b |
15 | 21b2bd3a21b |
hex | 11c2648b49d |
1220413011101 has 16 divisors (see below), whose sum is σ = 1305871257600. Its totient is φ = 1136537360640.
The previous prime is 1220413011073. The next prime is 1220413011179. The reversal of 1220413011101 is 1011103140221.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220413011101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1220413011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220413017101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 384221 + ... + 1608866.
It is an arithmetic number, because the mean of its divisors is an integer number (81616953600).
Almost surely, 21220413011101 is an apocalyptic number.
It is an amenable number.
1220413011101 is a deficient number, since it is larger than the sum of its proper divisors (85458246499).
1220413011101 is a wasteful number, since it uses less digits than its factorization.
1220413011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1993484.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1220413011101 its reverse (1011103140221), we get a palindrome (2231516151322).
The spelling of 1220413011101 in words is "one trillion, two hundred twenty billion, four hundred thirteen million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •