Base | Representation |
---|---|
bin | 10011000111010001… |
… | …011101111100101001 |
3 | 1221222021212020010202 |
4 | 103013101131330221 |
5 | 314012404124111 |
6 | 13232253321545 |
7 | 1324403410265 |
oct | 230721357451 |
9 | 57867766122 |
10 | 20523114281 |
11 | 878184357a |
12 | 3b891962b5 |
13 | 1c20b93807 |
14 | dc99770a5 |
15 | 801b4cb3b |
hex | 4c745df29 |
20523114281 has 2 divisors, whose sum is σ = 20523114282. Its totient is φ = 20523114280.
The previous prime is 20523114277. The next prime is 20523114361. The reversal of 20523114281 is 18241132502.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17402886400 + 3120227881 = 131920^2 + 55859^2 .
It is a cyclic number.
It is not a de Polignac number, because 20523114281 - 22 = 20523114277 is a prime.
It is a super-2 number, since 2×205231142812 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20523114211) 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, 10261557140 + 10261557141.
It is an arithmetic number, because the mean of its divisors is an integer number (10261557141).
Almost surely, 220523114281 is an apocalyptic number.
It is an amenable number.
20523114281 is a deficient number, since it is larger than the sum of its proper divisors (1).
20523114281 is an equidigital number, since it uses as much as digits as its factorization.
20523114281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 29.
Adding to 20523114281 its reverse (18241132502), we get a palindrome (38764246783).
The spelling of 20523114281 in words is "twenty billion, five hundred twenty-three million, one hundred fourteen thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •