Base | Representation |
---|---|
bin | 10001110000011001100… |
… | …101111111010011101110 |
3 | 11022122112211202120100010 |
4 | 101300121211333103232 |
5 | 124442432211213402 |
6 | 2332315134514050 |
7 | 154104460505043 |
oct | 21603145772356 |
9 | 4278484676303 |
10 | 1220200101102 |
11 | 430536168024 |
12 | 178596665926 |
13 | 8b0ab583958 |
14 | 430b521b1ca |
15 | 21b182d0a6c |
hex | 11c1997f4ee |
1220200101102 has 8 divisors (see below), whose sum is σ = 2440400202216. Its totient is φ = 406733367032.
The previous prime is 1220200101077. The next prime is 1220200101137. The reversal of 1220200101102 is 2011010020221.
It is a sphenic number, since it is the product of 3 distinct primes.
1220200101102 is an admirable number.
It is a super-2 number, since 2×12202001011022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 101683341753 + ... + 101683341764.
It is an arithmetic number, because the mean of its divisors is an integer number (305050025277).
Almost surely, 21220200101102 is an apocalyptic number.
1220200101102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220200101102 is a wasteful number, since it uses less digits than its factorization.
1220200101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203366683522.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1220200101102 its reverse (2011010020221), we get a palindrome (3231210121323).
The spelling of 1220200101102 in words is "one trillion, two hundred twenty billion, two hundred million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •