Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00111001111010110011101 |
3 | 2121212222221221201101002201 |
4 | 10203112012213033112131 |
5 | 10111011203324000333 |
6 | 110325322233451501 |
7 | 4134322355405404 |
oct | 443260647172635 |
9 | 77788857641081 |
10 | 20021101000093 |
11 | 64199a0624796 |
12 | 22b4282270b91 |
13 | b22c9bacc5cb |
14 | 4d305286263b |
15 | 24abdc5d417d |
hex | 1235869cf59d |
20021101000093 has 2 divisors, whose sum is σ = 20021101000094. Its totient is φ = 20021101000092.
The previous prime is 20021101000037. The next prime is 20021101000097. The reversal of 20021101000093 is 39000010112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19992675714489 + 28425285604 = 4471317^2 + 168598^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20021101000093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20021101000093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20021101000097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010550500046 + 10010550500047.
It is an arithmetic number, because the mean of its divisors is an integer number (10010550500047).
Almost surely, 220021101000093 is an apocalyptic number.
It is an amenable number.
20021101000093 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021101000093 is an equidigital number, since it uses as much as digits as its factorization.
20021101000093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 20021101000093 its reverse (39000010112002), we get a palindrome (59021111112095).
The spelling of 20021101000093 in words is "twenty trillion, twenty-one billion, one hundred one million, ninety-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •