Base | Representation |
---|---|
bin | 10001110000011010111… |
… | …001111010011000010100 |
3 | 11022122121101011021112121 |
4 | 101300122321322120110 |
5 | 124443003324213022 |
6 | 2332321242225324 |
7 | 154105145503525 |
oct | 21603271723024 |
9 | 4278541137477 |
10 | 1220222101012 |
11 | 430547623972 |
12 | 1785a1ab5244 |
13 | 8b0b2cb7455 |
14 | 430b810684c |
15 | 21b1a1c92c7 |
hex | 11c1ae7a614 |
1220222101012 has 12 divisors (see below), whose sum is σ = 2135396409300. Its totient is φ = 610108841216.
The previous prime is 1220222100997. The next prime is 1220222101027. The reversal of 1220222101012 is 2101012220221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1220222100997) and next prime (1220222101027).
It can be written as a sum of positive squares in 2 ways, for example, as 538233518736 + 681988582276 = 733644^2 + 825826^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1922898 + ... + 2477494.
It is an arithmetic number, because the mean of its divisors is an integer number (177949700775).
Almost surely, 21220222101012 is an apocalyptic number.
It is an amenable number.
1220222101012 is a deficient number, since it is larger than the sum of its proper divisors (915174308288).
1220222101012 is a wasteful number, since it uses less digits than its factorization.
1220222101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1104650 (or 1104648 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1220222101012 its reverse (2101012220221), we get a palindrome (3321234321233).
The spelling of 1220222101012 in words is "one trillion, two hundred twenty billion, two hundred twenty-two million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •