Base | Representation |
---|---|
bin | 1001010001110101011010… |
… | …1010001010011001010001 |
3 | 1100010022011000011111201112 |
4 | 2110131112222022121101 |
5 | 2314122144303034301 |
6 | 33410422404143105 |
7 | 2102033046400406 |
oct | 224352652123121 |
9 | 40108130144645 |
10 | 10202001221201 |
11 | 328370a7a6339 |
12 | 1189271697a95 |
13 | 590076c5b84a |
14 | 273acad062ad |
15 | 12a59de1b9bb |
hex | 94756a8a651 |
10202001221201 has 8 divisors (see below), whose sum is σ = 10651537127040. Its totient is φ = 9752962868352.
The previous prime is 10202001221189. The next prime is 10202001221213. The reversal of 10202001221201 is 10212210020201.
It is an interprime number because it is at equal distance from previous prime (10202001221189) and next prime (10202001221213).
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 10202001221201 - 230 = 10200927479377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10202001224201) 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, 124346336 + ... + 124428353.
It is an arithmetic number, because the mean of its divisors is an integer number (1331442140880).
Almost surely, 210202001221201 is an apocalyptic number.
It is an amenable number.
10202001221201 is a deficient number, since it is larger than the sum of its proper divisors (449535905839).
10202001221201 is a wasteful number, since it uses less digits than its factorization.
10202001221201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 248776495.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10202001221201 its reverse (10212210020201), we get a palindrome (20414211241402).
The spelling of 10202001221201 in words is "ten trillion, two hundred two billion, one million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •