Base | Representation |
---|---|
bin | 100000000001110111110… |
… | …011000111110010111010 |
3 | 21210102020210011202200202 |
4 | 200001313303013302322 |
5 | 242030203441124110 |
6 | 4403050215002202 |
7 | 315006440022122 |
oct | 40016763076272 |
9 | 7712223152622 |
10 | 2201033145530 |
11 | 7794a891456a |
12 | 2b66a9669362 |
13 | 12c73092735b |
14 | 7875dc69c82 |
15 | 3c3c1ece0a5 |
hex | 20077cc7cba |
2201033145530 has 16 divisors (see below), whose sum is σ = 3962100756744. Its totient is φ = 880359681600.
The previous prime is 2201033145529. The next prime is 2201033145533. The reversal of 2201033145530 is 355413301022.
It is a happy number.
2201033145530 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2173268588401 + 27764557129 = 1474201^2 + 166627^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2201033145493 and 2201033145502.
It is not an unprimeable number, because it can be changed into a prime (2201033145533) 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, 6524321 + ... + 6853380.
Almost surely, 22201033145530 is an apocalyptic number.
2201033145530 is a deficient number, since it is larger than the sum of its proper divisors (1761067611214).
2201033145530 is a wasteful number, since it uses less digits than its factorization.
2201033145530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13394161.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 2201033145530 its reverse (355413301022), we get a palindrome (2556446446552).
It can be divided in two parts, 220103 and 3145530, that added together give a palindrome (3365633).
The spelling of 2201033145530 in words is "two trillion, two hundred one billion, thirty-three million, one hundred forty-five thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •