Base | Representation |
---|---|
bin | 1100110011111011111… |
… | …0111010000011011001 |
3 | 210001010010222222221200 |
4 | 3030332332322003121 |
5 | 12101231100311301 |
6 | 245040151024413 |
7 | 21621166134561 |
oct | 3147676720331 |
9 | 701103888850 |
10 | 220100010201 |
11 | 85386799385 |
12 | 367a706b109 |
13 | 179a8642136 |
14 | a91d79bda1 |
15 | 5ad2d97c86 |
hex | 333efba0d9 |
220100010201 has 12 divisors (see below), whose sum is σ = 319947221412. Its totient is φ = 145798731936.
The previous prime is 220100010181. The next prime is 220100010239. The reversal of 220100010201 is 102010001022.
It can be written as a sum of positive squares in 2 ways, for example, as 166544793801 + 53555216400 = 408099^2 + 231420^2 .
It is not a de Polignac number, because 220100010201 - 27 = 220100010073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (220100010101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 77882526 + ... + 77885351.
It is an arithmetic number, because the mean of its divisors is an integer number (26662268451).
Almost surely, 2220100010201 is an apocalyptic number.
It is an amenable number.
220100010201 is a deficient number, since it is larger than the sum of its proper divisors (99847211211).
220100010201 is a wasteful number, since it uses less digits than its factorization.
220100010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155768040 (or 155768037 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 220100010201 its reverse (102010001022), we get a palindrome (322110011223).
The spelling of 220100010201 in words is "two hundred twenty billion, one hundred million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •