Base | Representation |
---|---|
bin | 1001010001110101110010… |
… | …0011011001101101001001 |
3 | 1100010022101220020200200011 |
4 | 2110131130203121231021 |
5 | 2314122400112042301 |
6 | 33410440255511521 |
7 | 2102035360063354 |
oct | 224353443315511 |
9 | 40108356220604 |
10 | 10202100112201 |
11 | 32837605aa638 |
12 | 118929a8285a1 |
13 | 5900915a462a |
14 | 273ada0c929b |
15 | 12a5a7952a51 |
hex | 9475c8d9b49 |
10202100112201 has 2 divisors, whose sum is σ = 10202100112202. Its totient is φ = 10202100112200.
The previous prime is 10202100112117. The next prime is 10202100112261. The reversal of 10202100112201 is 10221100120201.
10202100112201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5154443715600 + 5047656396601 = 2270340^2 + 2246699^2 .
It is a cyclic number.
It is not a de Polignac number, because 10202100112201 - 225 = 10202066557769 is a prime.
It is not a weakly prime, because it can be changed into another prime (10202100112261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101050056100 + 5101050056101.
It is an arithmetic number, because the mean of its divisors is an integer number (5101050056101).
Almost surely, 210202100112201 is an apocalyptic number.
It is an amenable number.
10202100112201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202100112201 is an equidigital number, since it uses as much as digits as its factorization.
10202100112201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10202100112201 its reverse (10221100120201), we get a palindrome (20423200232402).
The spelling of 10202100112201 in words is "ten trillion, two hundred two billion, one hundred million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •