Base | Representation |
---|---|
bin | 10101011100000111… |
… | …001000101111000101 |
3 | 2012102022120220001122 |
4 | 111130013020233011 |
5 | 334121133224031 |
6 | 14324135003325 |
7 | 1443314365124 |
oct | 253407105705 |
9 | 65368526048 |
10 | 23020211141 |
11 | 9843344394 |
12 | 4565509545 |
13 | 222b317715 |
14 | 118546dabb |
15 | 8eaea347b |
hex | 55c1c8bc5 |
23020211141 has 2 divisors, whose sum is σ = 23020211142. Its totient is φ = 23020211140.
The previous prime is 23020211129. The next prime is 23020211143. The reversal of 23020211141 is 14111202032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18470169025 + 4550042116 = 135905^2 + 67454^2 .
It is a cyclic number.
It is not a de Polignac number, because 23020211141 - 26 = 23020211077 is a prime.
It is a Sophie Germain prime.
Together with 23020211143, it forms a pair of twin primes.
It is a Chen 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 (23020211143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11510105570 + 11510105571.
It is an arithmetic number, because the mean of its divisors is an integer number (11510105571).
Almost surely, 223020211141 is an apocalyptic number.
It is an amenable number.
23020211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
23020211141 is an equidigital number, since it uses as much as digits as its factorization.
23020211141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 23020211141 its reverse (14111202032), we get a palindrome (37131413173).
The spelling of 23020211141 in words is "twenty-three billion, twenty million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •