Base | Representation |
---|---|
bin | 10010101111011011… |
… | …001001111011001101 |
3 | 1220221101222100020202 |
4 | 102233123021323031 |
5 | 312202442004100 |
6 | 13124441423245 |
7 | 1311444453005 |
oct | 225733117315 |
9 | 56841870222 |
10 | 20123000525 |
11 | 8596a00151 |
12 | 3a9719ab25 |
13 | 1b89012504 |
14 | d8c783005 |
15 | 7cb9657d5 |
hex | 4af6c9ecd |
20123000525 has 6 divisors (see below), whose sum is σ = 24952520682. Its totient is φ = 16098400400.
The previous prime is 20123000507. The next prime is 20123000561. The reversal of 20123000525 is 52500032102.
It can be written as a sum of positive squares in 3 ways, for example, as 3454383076 + 16668617449 = 58774^2 + 129107^2 .
It is not a de Polignac number, because 20123000525 - 224 = 20106223309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20123000497 and 20123000506.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 402459986 + ... + 402460035.
It is an arithmetic number, because the mean of its divisors is an integer number (4158753447).
Almost surely, 220123000525 is an apocalyptic number.
20123000525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20123000525 is a deficient number, since it is larger than the sum of its proper divisors (4829520157).
20123000525 is an equidigital number, since it uses as much as digits as its factorization.
20123000525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804920031 (or 804920026 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
Adding to 20123000525 its reverse (52500032102), we get a palindrome (72623032627).
The spelling of 20123000525 in words is "twenty billion, one hundred twenty-three million, five hundred twenty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •