Base | Representation |
---|---|
bin | 11110110001001110011… |
… | …11000101100100011100 |
3 | 10202001212111100211121100 |
4 | 33120213033011210130 |
5 | 114310141334034322 |
6 | 2125402534233100 |
7 | 136244621415261 |
oct | 17304717054434 |
9 | 3661774324540 |
10 | 1057220221212 |
11 | 378401287011 |
12 | 150a90ab5790 |
13 | 78906b587bc |
14 | 39253a5b268 |
15 | 1c779e25dac |
hex | f6273c591c |
1057220221212 has 36 divisors (see below), whose sum is σ = 2672609550520. Its totient is φ = 352381452192.
The previous prime is 1057220221207. The next prime is 1057220221237. The reversal of 1057220221212 is 2121220227501.
1057220221212 is a `hidden beast` number, since 1 + 0 + 5 + 7 + 220 + 221 + 212 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×10572202212122 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 541618 + ... + 1551705.
Almost surely, 21057220221212 is an apocalyptic number.
1057220221212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1057220221212 is an abundant number, since it is smaller than the sum of its proper divisors (1615389329308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1057220221212 is a wasteful number, since it uses less digits than its factorization.
1057220221212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2107362 (or 2107357 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
Adding to 1057220221212 its reverse (2121220227501), we get a palindrome (3178440448713).
The spelling of 1057220221212 in words is "one trillion, fifty-seven billion, two hundred twenty million, two hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.428 sec. • engine limits •