Base | Representation |
---|---|
bin | 1100110011100111100… |
… | …0000111011111000101 |
3 | 210000220011210201012100 |
4 | 3030321320013133011 |
5 | 12101042133003013 |
6 | 245023450542313 |
7 | 21616106032353 |
oct | 3147170073705 |
9 | 700804721170 |
10 | 220014344133 |
11 | 853423a8181 |
12 | 36782437999 |
13 | 17993979a5c |
14 | a91225c7d3 |
15 | 5aca5c5473 |
hex | 3339e077c5 |
220014344133 has 6 divisors (see below), whose sum is σ = 317798497094. Its totient is φ = 146676229416.
The previous prime is 220014344129. The next prime is 220014344141. The reversal of 220014344133 is 331443410022.
220014344133 is a `hidden beast` number, since 2 + 200 + 1 + 43 + 4 + 413 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 217023676164 + 2990667969 = 465858^2 + 54687^2 .
It is not a de Polignac number, because 220014344133 - 22 = 220014344129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220014344097 and 220014344106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220014344153) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12223019110 + ... + 12223019127.
Almost surely, 2220014344133 is an apocalyptic number.
It is an amenable number.
220014344133 is a deficient number, since it is larger than the sum of its proper divisors (97784152961).
220014344133 is a wasteful number, since it uses less digits than its factorization.
220014344133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24446038243 (or 24446038240 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 220014344133 its reverse (331443410022), we get a palindrome (551457754155).
The spelling of 220014344133 in words is "two hundred twenty billion, fourteen million, three hundred forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •