Base | Representation |
---|---|
bin | 1100110011111100001… |
… | …1011111100001001001 |
3 | 210001010020021001211101 |
4 | 3030333003133201021 |
5 | 12101231402242413 |
6 | 245040232501401 |
7 | 21621212302210 |
oct | 3147703374111 |
9 | 701106231741 |
10 | 220101212233 |
11 | 8538743a4a1 |
12 | 367a754a861 |
13 | 179a89732b6 |
14 | a91d9d2077 |
15 | 5ad3033edd |
hex | 333f0df849 |
220101212233 has 8 divisors (see below), whose sum is σ = 256290360768. Its totient is φ = 185098593264.
The previous prime is 220101212231. The next prime is 220101212237. The reversal of 220101212233 is 332212101022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220101212233 - 21 = 220101212231 is a prime.
It is a super-2 number, since 2×2201012122332 (a number of 23 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 220101212233.
It is not an unprimeable number, because it can be changed into a prime (220101212231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 296631991 + ... + 296632732.
It is an arithmetic number, because the mean of its divisors is an integer number (32036295096).
Almost surely, 2220101212233 is an apocalyptic number.
It is an amenable number.
220101212233 is a deficient number, since it is larger than the sum of its proper divisors (36189148535).
220101212233 is an equidigital number, since it uses as much as digits as its factorization.
220101212233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593264783.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 220101212233 its reverse (332212101022), we get a palindrome (552313313255).
The spelling of 220101212233 in words is "two hundred twenty billion, one hundred one million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •