Base | Representation |
---|---|
bin | 10010101010110010… |
… | …011101111001000010 |
3 | 1220201222121222000200 |
4 | 102222302131321002 |
5 | 312023034204123 |
6 | 13113022430030 |
7 | 1306511414532 |
oct | 225262357102 |
9 | 56658558020 |
10 | 20045225538 |
11 | 85570096a8 |
12 | 3a75132316 |
13 | 1b75b80b00 |
14 | d822d94c2 |
15 | 7c4c01143 |
hex | 4aac9de42 |
20045225538 has 162 divisors, whose sum is σ = 50291377227. Its totient is φ = 5766508800.
The previous prime is 20045225531. The next prime is 20045225579. The reversal of 20045225538 is 83552254002.
It is a happy number.
It can be written as a sum of positive squares in 5 ways, for example, as 8126481609 + 11918743929 = 90147^2 + 109173^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=100113.
It is a super-2 number, since 2×200452255382 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20045225531) by changing a digit.
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 80 ways as a sum of consecutive naturals, for example, 132749763 + ... + 132749913.
Almost surely, 220045225538 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20045225538
20045225538 is an abundant number, since it is smaller than the sum of its proper divisors (30246151689).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20045225538 is a wasteful number, since it uses less digits than its factorization.
20045225538 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370 (or 186 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
The spelling of 20045225538 in words is "twenty billion, forty-five million, two hundred twenty-five thousand, five hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •