Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …101110000101001010011010 |
3 | 222101001221002101200202021212 |
4 | 231232202102232011022122 |
5 | 202324441300104034320 |
6 | 1551420355132503122 |
7 | 60234501350444456 |
oct | 5556422256051232 |
9 | 871057071622255 |
10 | 201110010221210 |
11 | 5909730492a732 |
12 | 1a68057361aaa2 |
13 | 882a791bc2a6c |
14 | 3793ac2751666 |
15 | 183b4ed76b9c5 |
hex | b6e892b8529a |
201110010221210 has 8 divisors (see below), whose sum is σ = 361998018398196. Its totient is φ = 80444004088480.
The previous prime is 201110010221203. The next prime is 201110010221213. The reversal of 201110010221210 is 12122010011102.
It can be written as a sum of positive squares in 2 ways, for example, as 201109922030329 + 88190881 = 14181323^2 + 9391^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2011100102212102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201110010221213) 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 3 ways as a sum of consecutive naturals, for example, 10055500511051 + ... + 10055500511070.
Almost surely, 2201110010221210 is an apocalyptic number.
201110010221210 is a deficient number, since it is larger than the sum of its proper divisors (160888008176986).
201110010221210 is a wasteful number, since it uses less digits than its factorization.
201110010221210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20111001022128.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201110010221210 its reverse (12122010011102), we get a palindrome (213232020232312).
The spelling of 201110010221210 in words is "two hundred one trillion, one hundred ten billion, ten million, two hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •