Base | Representation |
---|---|
bin | 1001010001110101011010… |
… | …1101111001100110111101 |
3 | 1100010022011002000021210011 |
4 | 2110131112231321212331 |
5 | 2314122200030413041 |
6 | 33410422441143221 |
7 | 2102033060621131 |
oct | 224352655714675 |
9 | 40108132007704 |
10 | 10202002201021 |
11 | 3283710305504 |
12 | 1189271a8ab11 |
13 | 590077212817 |
14 | 273acb0bd3c1 |
15 | 12a59e061e81 |
hex | 94756b799bd |
10202002201021 has 2 divisors, whose sum is σ = 10202002201022. Its totient is φ = 10202002201020.
The previous prime is 10202002201009. The next prime is 10202002201099. The reversal of 10202002201021 is 12010220020201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9988197688921 + 213804512100 = 3160411^2 + 462390^2 .
It is a cyclic number.
It is not a de Polignac number, because 10202002201021 - 219 = 10202001676733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10202002200992 and 10202002201010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10202002231021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101001100510 + 5101001100511.
It is an arithmetic number, because the mean of its divisors is an integer number (5101001100511).
Almost surely, 210202002201021 is an apocalyptic number.
It is an amenable number.
10202002201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202002201021 is an equidigital number, since it uses as much as digits as its factorization.
10202002201021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10202002201021 its reverse (12010220020201), we get a palindrome (22212222221222).
The spelling of 10202002201021 in words is "ten trillion, two hundred two billion, two million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •