Base | Representation |
---|---|
bin | 1100110011111100001… |
… | …0101110011101101111 |
3 | 210001010012212212012211 |
4 | 3030333002232131233 |
5 | 12101231324330221 |
6 | 245040224311251 |
7 | 21621210504346 |
oct | 3147702563557 |
9 | 701105785184 |
10 | 220101011311 |
11 | 85387312545 |
12 | 367a7472527 |
13 | 179a89029cc |
14 | a91d97cb5d |
15 | 5ad2ee46e1 |
hex | 333f0ae76f |
220101011311 has 4 divisors (see below), whose sum is σ = 220106138824. Its totient is φ = 220095883800.
The previous prime is 220101011303. The next prime is 220101011359. The reversal of 220101011311 is 113110101022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113110101022 = 2 ⋅56555050511.
It is a cyclic number.
It is not a de Polignac number, because 220101011311 - 23 = 220101011303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220101011291 and 220101011300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220101011381) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2498820 + ... + 2585401.
It is an arithmetic number, because the mean of its divisors is an integer number (55026534706).
Almost surely, 2220101011311 is an apocalyptic number.
220101011311 is a deficient number, since it is larger than the sum of its proper divisors (5127513).
220101011311 is an equidigital number, since it uses as much as digits as its factorization.
220101011311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5127512.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 220101011311 its reverse (113110101022), we get a palindrome (333211112333).
The spelling of 220101011311 in words is "two hundred twenty billion, one hundred one million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •