Base | Representation |
---|---|
bin | 100000000001110110011… |
… | …011001111111000110001 |
3 | 21210102012011211102220000 |
4 | 200001312123033320301 |
5 | 242030132042010001 |
6 | 4403044033140213 |
7 | 315006040151133 |
oct | 40016633177061 |
9 | 7712164742800 |
10 | 2201010110001 |
11 | 77949691063a |
12 | 2b66a19ba669 |
13 | 12c728c20371 |
14 | 7875ab91053 |
15 | 3c3bee7da86 |
hex | 200766cfe31 |
2201010110001 has 10 divisors (see below), whose sum is σ = 3287928682962. Its totient is φ = 1467340073280.
The previous prime is 2201010109981. The next prime is 2201010110003. The reversal of 2201010110001 is 1000110101022.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1953842044401 + 247168065600 = 1397799^2 + 497160^2 .
It is not a de Polignac number, because 2201010110001 - 217 = 2201009978929 is a prime.
It is a super-2 number, since 2×22010101100012 (a number of 25 digits) contains 22 as substring.
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 (2201010110003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 13586482080 + ... + 13586482241.
Almost surely, 22201010110001 is an apocalyptic number.
It is an amenable number.
2201010110001 is a deficient number, since it is larger than the sum of its proper divisors (1086918572961).
2201010110001 is an equidigital number, since it uses as much as digits as its factorization.
2201010110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27172964333 (or 27172964324 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2201010110001 its reverse (1000110101022), we get a palindrome (3201120211023).
The spelling of 2201010110001 in words is "two trillion, two hundred one billion, ten million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •