Base | Representation |
---|---|
bin | 101111110001100010001111… |
… | …000111000001001101111001 |
3 | 1000112221112022120000212100121 |
4 | 233301202033013001031321 |
5 | 210014434241440232301 |
6 | 2022512113533333241 |
7 | 62154051133422136 |
oct | 5761421707011571 |
9 | 1015845276025317 |
10 | 210112201102201 |
11 | 60a480a19aa102 |
12 | 1b69519b037221 |
13 | 9031659940528 |
14 | 39c56b03bd58d |
15 | 19457794633a1 |
hex | bf188f1c1379 |
210112201102201 has 16 divisors (see below), whose sum is σ = 223462673537040. Its totient is φ = 197204469073920.
The previous prime is 210112201102169. The next prime is 210112201102217. The reversal of 210112201102201 is 102201102211012.
It can be written as a sum of positive squares in 8 ways, for example, as 14978262270976 + 195133938831225 = 3870176^2 + 13969035^2 .
It is a cyclic number.
It is not a de Polignac number, because 210112201102201 - 25 = 210112201102169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210112201102241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 318647856 + ... + 319306561.
It is an arithmetic number, because the mean of its divisors is an integer number (13966417096065).
Almost surely, 2210112201102201 is an apocalyptic number.
It is an amenable number.
210112201102201 is a deficient number, since it is larger than the sum of its proper divisors (13350472434839).
210112201102201 is a wasteful number, since it uses less digits than its factorization.
210112201102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 637954764.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 210112201102201 its reverse (102201102211012), we get a palindrome (312313303313213).
The spelling of 210112201102201 in words is "two hundred ten trillion, one hundred twelve billion, two hundred one million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •