Base | Representation |
---|---|
bin | 1001010001101110110001… |
… | …1111101110011001101001 |
3 | 1100010010112212200012001002 |
4 | 2110123230133232121221 |
5 | 2314110022321201301 |
6 | 33405525540404345 |
7 | 2101640651202665 |
oct | 224335437563151 |
9 | 40103485605032 |
10 | 10200220100201 |
11 | 328298636680a |
12 | 1188a550a66b5 |
13 | 58cb51c4b8b1 |
14 | 27399c5458a5 |
15 | 12a4e789216b |
hex | 946ec7ee669 |
10200220100201 has 12 divisors (see below), whose sum is σ = 10658299266900. Its totient is φ = 9760268517120.
The previous prime is 10200220100111. The next prime is 10200220100243. The reversal of 10200220100201 is 10200102200201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2030912860201 + 8169307240000 = 1425101^2 + 2858200^2 .
It is not a de Polignac number, because 10200220100201 - 242 = 5802173589097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200220150201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59544656 + ... + 59715713.
It is an arithmetic number, because the mean of its divisors is an integer number (888191605575).
Almost surely, 210200220100201 is an apocalyptic number.
It is an amenable number.
10200220100201 is a deficient number, since it is larger than the sum of its proper divisors (458079166699).
10200220100201 is an equidigital number, since it uses as much as digits as its factorization.
10200220100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119260520 (or 119260489 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10200220100201 its reverse (10200102200201), we get a palindrome (20400322300402).
The spelling of 10200220100201 in words is "ten trillion, two hundred billion, two hundred twenty million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •