Base | Representation |
---|---|
bin | 10010101111111111… |
… | …100101011101111011 |
3 | 1220222001221112101101 |
4 | 102233333211131323 |
5 | 312212413104043 |
6 | 13125422232231 |
7 | 1311621566401 |
oct | 225777453573 |
9 | 56861845341 |
10 | 20132550523 |
11 | 85a1333208 |
12 | 3a9a425677 |
13 | 1b8aca72b7 |
14 | d8db4b471 |
15 | 7cc70024d |
hex | 4affe577b |
20132550523 has 2 divisors, whose sum is σ = 20132550524. Its totient is φ = 20132550522.
The previous prime is 20132550521. The next prime is 20132550547. The reversal of 20132550523 is 32505523102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20132550523 - 21 = 20132550521 is a prime.
It is a super-2 number, since 2×201325505232 (a number of 21 digits) contains 22 as substring.
Together with 20132550521, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20132550491 and 20132550500.
It is not a weakly prime, because it can be changed into another prime (20132550521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066275261 + 10066275262.
It is an arithmetic number, because the mean of its divisors is an integer number (10066275262).
Almost surely, 220132550523 is an apocalyptic number.
20132550523 is a deficient number, since it is larger than the sum of its proper divisors (1).
20132550523 is an equidigital number, since it uses as much as digits as its factorization.
20132550523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 28.
The spelling of 20132550523 in words is "twenty billion, one hundred thirty-two million, five hundred fifty thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •