Base | Representation |
---|---|
bin | 10011000000110101… |
… | …001000010011110101 |
3 | 1221200202110120211222 |
4 | 103000311020103311 |
5 | 313302221203300 |
6 | 13213432440125 |
7 | 1321621553345 |
oct | 230065102365 |
9 | 57622416758 |
10 | 20415022325 |
11 | 8726825485 |
12 | 3b58b49045 |
13 | 1c04678a89 |
14 | db947ad25 |
15 | 7e73ea785 |
hex | 4c0d484f5 |
20415022325 has 12 divisors (see below), whose sum is σ = 25404724068. Its totient is φ = 16273891200.
The previous prime is 20415022291. The next prime is 20415022337. The reversal of 20415022325 is 52322051402.
It can be written as a sum of positive squares in 6 ways, for example, as 1205339524 + 19209682801 = 34718^2 + 138599^2 .
It is not a de Polignac number, because 20415022325 - 210 = 20415021301 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20415022294 and 20415022303.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1446002 + ... + 1460051.
It is an arithmetic number, because the mean of its divisors is an integer number (2117060339).
Almost surely, 220415022325 is an apocalyptic number.
20415022325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20415022325 is a deficient number, since it is larger than the sum of its proper divisors (4989701743).
20415022325 is a wasteful number, since it uses less digits than its factorization.
20415022325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906344 (or 2906339 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 20415022325 its reverse (52322051402), we get a palindrome (72737073727).
The spelling of 20415022325 in words is "twenty billion, four hundred fifteen million, twenty-two thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •