Base | Representation |
---|---|
bin | 1001001001000001000101… |
… | …10111111001000010110001 |
3 | 2122011122021111001000012122 |
4 | 10210200202313321002301 |
5 | 10113313403144202233 |
6 | 110430141525004025 |
7 | 4143152212031303 |
oct | 444404267710261 |
9 | 78148244030178 |
10 | 20101032022193 |
11 | 644a8885a8741 |
12 | 230786ab53615 |
13 | b2a699862ba5 |
14 | 4d6c763a3973 |
15 | 24cd199c9d98 |
hex | 124822df90b1 |
20101032022193 has 2 divisors, whose sum is σ = 20101032022194. Its totient is φ = 20101032022192.
The previous prime is 20101032022129. The next prime is 20101032022223. The reversal of 20101032022193 is 39122023010102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16312002371344 + 3789029650849 = 4038812^2 + 1946543^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101032022193 - 26 = 20101032022129 is a prime.
It is not a weakly prime, because it can be changed into another prime (20101032022493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050516011096 + 10050516011097.
It is an arithmetic number, because the mean of its divisors is an integer number (10050516011097).
Almost surely, 220101032022193 is an apocalyptic number.
It is an amenable number.
20101032022193 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101032022193 is an equidigital number, since it uses as much as digits as its factorization.
20101032022193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 20101032022193 its reverse (39122023010102), we get a palindrome (59223055032295).
The spelling of 20101032022193 in words is "twenty trillion, one hundred one billion, thirty-two million, twenty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •