Base | Representation |
---|---|
bin | 1001000111010000001110… |
… | …1010010011011100010101 |
3 | 1022110220221100221220221011 |
4 | 2101310003222103130111 |
5 | 2303132402322413101 |
6 | 33151120420252221 |
7 | 2052636252506032 |
oct | 221640352233425 |
9 | 38426840856834 |
10 | 10020220122901 |
11 | 321360803a69a |
12 | 1159b9b541071 |
13 | 578b973147a1 |
14 | 268da4754389 |
15 | 1259b0190751 |
hex | 91d03a93715 |
10020220122901 has 2 divisors, whose sum is σ = 10020220122902. Its totient is φ = 10020220122900.
The previous prime is 10020220122883. The next prime is 10020220122917. The reversal of 10020220122901 is 10922102202001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6878371702225 + 3141848420676 = 2622665^2 + 1772526^2 .
It is a cyclic number.
It is not a de Polignac number, because 10020220122901 - 211 = 10020220120853 is a prime.
It is a super-2 number, since 2×100202201229012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10020220122931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010110061450 + 5010110061451.
It is an arithmetic number, because the mean of its divisors is an integer number (5010110061451).
Almost surely, 210020220122901 is an apocalyptic number.
It is an amenable number.
10020220122901 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020220122901 is an equidigital number, since it uses as much as digits as its factorization.
10020220122901 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 10020220122901 its reverse (10922102202001), we get a palindrome (20942322324902).
The spelling of 10020220122901 in words is "ten trillion, twenty billion, two hundred twenty million, one hundred twenty-two thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •