Base | Representation |
---|---|
bin | 10001110000011010111… |
… | …000000101110000111011 |
3 | 11022122121100021000022121 |
4 | 101300122320011300323 |
5 | 124443003213421410 |
6 | 2332321224102111 |
7 | 154105141444120 |
oct | 21603270056073 |
9 | 4278540230277 |
10 | 1220221623355 |
11 | 430547328009 |
12 | 1785a1904937 |
13 | 8b0b2b7ac07 |
14 | 430b8020747 |
15 | 21b1a1329da |
hex | 11c1ae05c3b |
1220221623355 has 16 divisors (see below), whose sum is σ = 1679360050944. Its totient is φ = 833766772320.
The previous prime is 1220221623349. The next prime is 1220221623377. The reversal of 1220221623355 is 5533261220221.
It is not a de Polignac number, because 1220221623355 - 29 = 1220221622843 is a prime.
It is a super-2 number, since 2×12202216233552 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1220221623355.
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 15 ways as a sum of consecutive naturals, for example, 61586341 + ... + 61606150.
It is an arithmetic number, because the mean of its divisors is an integer number (104960003184).
Almost surely, 21220221623355 is an apocalyptic number.
1220221623355 is a deficient number, since it is larger than the sum of its proper divisors (459138427589).
1220221623355 is a wasteful number, since it uses less digits than its factorization.
1220221623355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123192786.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 1220221623355 its reverse (5533261220221), we get a palindrome (6753482843576).
The spelling of 1220221623355 in words is "one trillion, two hundred twenty billion, two hundred twenty-one million, six hundred twenty-three thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •