Base | Representation |
---|---|
bin | 1001001001010100010010… |
… | …10110011010001111001101 |
3 | 2122012121212221122011221212 |
4 | 10210222021112122033031 |
5 | 10114001011323424401 |
6 | 110435004515104205 |
7 | 4143665532624626 |
oct | 444521126321715 |
9 | 78177787564855 |
10 | 20111341233101 |
11 | 6454198908458 |
12 | 23098675a2065 |
13 | b2b6506247a1 |
14 | 4d7573616a4d |
15 | 24d21eab5dbb |
hex | 124a8959a3cd |
20111341233101 has 2 divisors, whose sum is σ = 20111341233102. Its totient is φ = 20111341233100.
The previous prime is 20111341233079. The next prime is 20111341233227. The reversal of 20111341233101 is 10133214311102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18686158917001 + 1425182316100 = 4322749^2 + 1193810^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111341233101 - 214 = 20111341216717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111341233001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055670616550 + 10055670616551.
It is an arithmetic number, because the mean of its divisors is an integer number (10055670616551).
Almost surely, 220111341233101 is an apocalyptic number.
It is an amenable number.
20111341233101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111341233101 is an equidigital number, since it uses as much as digits as its factorization.
20111341233101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 20111341233101 its reverse (10133214311102), we get a palindrome (30244555544203).
The spelling of 20111341233101 in words is "twenty trillion, one hundred eleven billion, three hundred forty-one million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •