Base | Representation |
---|---|
bin | 10001110000011001100… |
… | …110010111101100110100 |
3 | 11022122112211221122101111 |
4 | 101300121212113230310 |
5 | 124442432222413022 |
6 | 2332315141004404 |
7 | 154104461402242 |
oct | 21603146275464 |
9 | 4278484848344 |
10 | 1220200201012 |
11 | 4305362260a1 |
12 | 1785966b3704 |
13 | 8b0ab5ba280 |
14 | 430b5245792 |
15 | 21b18300477 |
hex | 11c19997b34 |
1220200201012 has 12 divisors (see below), whose sum is σ = 2299608071236. Its totient is φ = 563169323520.
The previous prime is 1220200200997. The next prime is 1220200201027. The reversal of 1220200201012 is 2101020020221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1220200200997) and next prime (1220200201027).
It can be written as a sum of positive squares in 2 ways, for example, as 843098585616 + 377101615396 = 918204^2 + 614086^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 1220200200983 and 1220200201001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11732694189 + ... + 11732694292.
Almost surely, 21220200201012 is an apocalyptic number.
It is an amenable number.
1220200201012 is a deficient number, since it is larger than the sum of its proper divisors (1079407870224).
1220200201012 is a wasteful number, since it uses less digits than its factorization.
1220200201012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23465388498 (or 23465388496 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1220200201012 its reverse (2101020020221), we get a palindrome (3321220221233).
The spelling of 1220200201012 in words is "one trillion, two hundred twenty billion, two hundred million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •