Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …0111000000100110011001 |
3 | 1100010012211222102212011212 |
4 | 2110130201213000212121 |
5 | 2314113333431432301 |
6 | 33410154212032505 |
7 | 2102002021352003 |
oct | 224344147004631 |
9 | 40105758385155 |
10 | 10201111202201 |
11 | 32832a3370947 |
12 | 1189063602735 |
13 | 58cc6474b19a |
14 | 273a44a27373 |
15 | 12a54ac124bb |
hex | 947219c0999 |
10201111202201 has 8 divisors (see below), whose sum is σ = 10255156689480. Its totient is φ = 10147077983232.
The previous prime is 10201111202171. The next prime is 10201111202273. The reversal of 10201111202201 is 10220211110201.
It can be written as a sum of positive squares in 4 ways, for example, as 4769414842201 + 5431696360000 = 2183899^2 + 2330600^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10201111202201 - 230 = 10200037460377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201111202281) 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, 1397270 + ... + 4728063.
It is an arithmetic number, because the mean of its divisors is an integer number (1281894586185).
Almost surely, 210201111202201 is an apocalyptic number.
It is an amenable number.
10201111202201 is a deficient number, since it is larger than the sum of its proper divisors (54045487279).
10201111202201 is an equidigital number, since it uses as much as digits as its factorization.
10201111202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6134155.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10201111202201 its reverse (10220211110201), we get a palindrome (20421322312402).
The spelling of 10201111202201 in words is "ten trillion, two hundred one billion, one hundred eleven million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •