Base | Representation |
---|---|
bin | 10010101001011010… |
… | …101001110001010101 |
3 | 1220200101022102111121 |
4 | 102221122221301111 |
5 | 312001141034100 |
6 | 13110441203541 |
7 | 1306111640020 |
oct | 225132516125 |
9 | 56611272447 |
10 | 20022205525 |
11 | 85450163a3 |
12 | 3a694905b1 |
13 | 1b71180bba |
14 | d7d2261b7 |
15 | 7c2ba551a |
hex | 4a96a9c55 |
20022205525 has 48 divisors (see below), whose sum is σ = 29742096384. Its totient is φ = 13073100480.
The previous prime is 20022205519. The next prime is 20022205547. The reversal of 20022205525 is 52550222002.
It is not a de Polignac number, because 20022205525 - 27 = 20022205397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 20022205525.
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 47 ways as a sum of consecutive naturals, for example, 886422 + ... + 908728.
It is an arithmetic number, because the mean of its divisors is an integer number (619627008).
Almost surely, 220022205525 is an apocalyptic number.
20022205525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20022205525 is a deficient number, since it is larger than the sum of its proper divisors (9719890859).
20022205525 is a wasteful number, since it uses less digits than its factorization.
20022205525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22570 (or 22565 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 25.
Adding to 20022205525 its reverse (52550222002), we get a palindrome (72572427527).
The spelling of 20022205525 in words is "twenty billion, twenty-two million, two hundred five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •