Base | Representation |
---|---|
bin | 10010110100010001… |
… | …000000001001100000 |
3 | 1221011001210222110002 |
4 | 102310101000021200 |
5 | 312334240200440 |
6 | 13140502355132 |
7 | 1313452036262 |
oct | 226421001140 |
9 | 57131728402 |
10 | 20204225120 |
11 | 8628838412 |
12 | 3aba42baa8 |
13 | 1b9cab10c1 |
14 | d99487b32 |
15 | 7d3b5c115 |
hex | 4b4440260 |
20204225120 has 48 divisors (see below), whose sum is σ = 47885100480. Its totient is φ = 8055849984.
The previous prime is 20204225089. The next prime is 20204225123. The reversal of 20204225120 is 2152240202.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 20204225092 and 20204225101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20204225123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 151640 + ... + 251799.
It is an arithmetic number, because the mean of its divisors is an integer number (997606260).
Almost surely, 220204225120 is an apocalyptic number.
20204225120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20204225120 is an abundant number, since it is smaller than the sum of its proper divisors (27680875360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20204225120 is a wasteful number, since it uses less digits than its factorization.
20204225120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 403767 (or 403759 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 20.
Adding to 20204225120 its reverse (2152240202), we get a palindrome (22356465322).
The spelling of 20204225120 in words is "twenty billion, two hundred four million, two hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •