Base | Representation |
---|---|
bin | 100000000001110110011… |
… | …011001111111100001110 |
3 | 21210102012011211110012012 |
4 | 200001312123033330032 |
5 | 242030132042011342 |
6 | 4403044033141222 |
7 | 315006040151600 |
oct | 40016633177416 |
9 | 7712164743165 |
10 | 2201010110222 |
11 | 779496910820 |
12 | 2b66a19ba812 |
13 | 12c728c204b1 |
14 | 7875ab91170 |
15 | 3c3bee7db82 |
hex | 200766cff0e |
2201010110222 has 48 divisors (see below), whose sum is σ = 4228833961728. Its totient is φ = 849522003120.
The previous prime is 2201010110191. The next prime is 2201010110231. The reversal of 2201010110222 is 2220110101022.
2201010110222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 2201010110197 and 2201010110206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9425558 + ... + 9656249.
It is an arithmetic number, because the mean of its divisors is an integer number (88100707536).
Almost surely, 22201010110222 is an apocalyptic number.
2201010110222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2201010110222 is a deficient number, since it is larger than the sum of its proper divisors (2027823851506).
2201010110222 is a wasteful number, since it uses less digits than its factorization.
2201010110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19081941 (or 19081934 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2201010110222 its reverse (2220110101022), we get a palindrome (4421120211244).
The spelling of 2201010110222 in words is "two trillion, two hundred one billion, ten million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •