Base | Representation |
---|---|
bin | 10010110000001001… |
… | …110111000101011101 |
3 | 1220222021000101022102 |
4 | 102300021313011131 |
5 | 312214110303000 |
6 | 13130000054445 |
7 | 1311653515433 |
oct | 226011670535 |
9 | 56867011272 |
10 | 20135244125 |
11 | 85a2902a27 |
12 | 3a9b304425 |
13 | 1b8b70b349 |
14 | d9024cd53 |
15 | 7cca833d5 |
hex | 4b027715d |
20135244125 has 24 divisors (see below), whose sum is σ = 26693947176. Its totient is φ = 15160627200.
The previous prime is 20135244097. The next prime is 20135244133. The reversal of 20135244125 is 52144253102.
It can be written as a sum of positive squares in 12 ways, for example, as 11590460281 + 8544783844 = 107659^2 + 92438^2 .
It is not a de Polignac number, because 20135244125 - 212 = 20135240029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 242564 + ... + 314813.
It is an arithmetic number, because the mean of its divisors is an integer number (1112247799).
Almost surely, 220135244125 is an apocalyptic number.
20135244125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20135244125 is a deficient number, since it is larger than the sum of its proper divisors (6558703051).
20135244125 is an equidigital number, since it uses as much as digits as its factorization.
20135244125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557426 (or 557399 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 20135244125 its reverse (52144253102), we get a palindrome (72279497227).
The spelling of 20135244125 in words is "twenty billion, one hundred thirty-five million, two hundred forty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •