Base | Representation |
---|---|
bin | 1001010001110001101011… |
… | …1111010001011101101101 |
3 | 1100010012120020102102002112 |
4 | 2110130122333101131231 |
5 | 2314113122012402341 |
6 | 33410135203133405 |
7 | 2101666202241446 |
oct | 224343277213555 |
9 | 40105506372075 |
10 | 10201000122221 |
11 | 32832466a1907 |
12 | 1189032374265 |
13 | 58cc4772839c |
14 | 273a33d902cd |
15 | 12a5410beaeb |
hex | 9471afd176d |
10201000122221 has 2 divisors, whose sum is σ = 10201000122222. Its totient is φ = 10201000122220.
The previous prime is 10201000122169. The next prime is 10201000122227. The reversal of 10201000122221 is 12222100010201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9822670564996 + 378329557225 = 3134114^2 + 615085^2 .
It is a cyclic number.
It is not a de Polignac number, because 10201000122221 - 210 = 10201000121197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10201000122196 and 10201000122205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201000122227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100500061110 + 5100500061111.
It is an arithmetic number, because the mean of its divisors is an integer number (5100500061111).
Almost surely, 210201000122221 is an apocalyptic number.
It is an amenable number.
10201000122221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201000122221 is an equidigital number, since it uses as much as digits as its factorization.
10201000122221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10201000122221 its reverse (12222100010201), we get a palindrome (22423100132422).
The spelling of 10201000122221 in words is "ten trillion, two hundred one billion, one hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •