Base | Representation |
---|---|
bin | 1100111000000111000… |
… | …0100001000001001001 |
3 | 210011000020001011220001 |
4 | 3032001300201001021 |
5 | 12111024344423423 |
6 | 245343251003001 |
7 | 21661021422154 |
oct | 3160160410111 |
9 | 704006034801 |
10 | 221220311113 |
11 | 85901109aaa |
12 | 36a5a299461 |
13 | 17b26780199 |
14 | a9c84a2c9b |
15 | 5b4b3ddcad |
hex | 3381c21049 |
221220311113 has 8 divisors (see below), whose sum is σ = 221456983040. Its totient is φ = 220983759360.
The previous prime is 221220311089. The next prime is 221220311129. The reversal of 221220311113 is 311113022122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221220311113 is a prime.
It is a super-2 number, since 2×2212203111132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221220311153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3927556 + ... + 3983482.
It is an arithmetic number, because the mean of its divisors is an integer number (27682122880).
Almost surely, 2221220311113 is an apocalyptic number.
It is an amenable number.
221220311113 is a deficient number, since it is larger than the sum of its proper divisors (236671927).
221220311113 is a wasteful number, since it uses less digits than its factorization.
221220311113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60087.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 221220311113 its reverse (311113022122), we get a palindrome (532333333235).
The spelling of 221220311113 in words is "two hundred twenty-one billion, two hundred twenty million, three hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •