Base | Representation |
---|---|
bin | 10100100001000110… |
… | …110000000110111101 |
3 | 2002212022210212212210 |
4 | 110201012300012331 |
5 | 330104221121100 |
6 | 14042012451033 |
7 | 1406634034206 |
oct | 244106600675 |
9 | 62768725783 |
10 | 22030254525 |
11 | 9385560324 |
12 | 4329a79a79 |
13 | 21011b5a86 |
14 | 10cdbb85ad |
15 | 88e107c50 |
hex | 5211b01bd |
22030254525 has 96 divisors (see below), whose sum is σ = 39271557888. Its totient is φ = 10857369600.
The previous prime is 22030254511. The next prime is 22030254529. The reversal of 22030254525 is 52545203022.
It is not a de Polignac number, because 22030254525 - 211 = 22030252477 is a prime.
It is a super-2 number, since 2×220302545252 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22030254492 and 22030254501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22030254529) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 35938119 + ... + 35938731.
It is an arithmetic number, because the mean of its divisors is an integer number (409078728).
Almost surely, 222030254525 is an apocalyptic number.
22030254525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
22030254525 is a deficient number, since it is larger than the sum of its proper divisors (17241303363).
22030254525 is a wasteful number, since it uses less digits than its factorization.
22030254525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111 (or 1106 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 30.
Adding to 22030254525 its reverse (52545203022), we get a palindrome (74575457547).
The spelling of 22030254525 in words is "twenty-two billion, thirty million, two hundred fifty-four thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •