Base | Representation |
---|---|
bin | 10010101110001111… |
… | …010111000001000000 |
3 | 1220220000120212122211 |
4 | 102232033113001000 |
5 | 312132400144300 |
6 | 13122451511504 |
7 | 1311113536645 |
oct | 225617270100 |
9 | 56800525584 |
10 | 20103131200 |
11 | 858676a019 |
12 | 3a905b8594 |
13 | 1b84b76709 |
14 | d89c8ddcc |
15 | 7c9d3d4ba |
hex | 4ae3d7040 |
20103131200 has 84 divisors (see below), whose sum is σ = 50062577040. Its totient is φ = 7944317440.
The previous prime is 20103131161. The next prime is 20103131201. The reversal of 20103131200 is 213130102.
It is not an unprimeable number, because it can be changed into a prime (20103131201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 57111 + ... + 208489.
It is an arithmetic number, because the mean of its divisors is an integer number (595983060).
Almost surely, 220103131200 is an apocalyptic number.
20103131200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20103131200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25031288520).
20103131200 is an abundant number, since it is smaller than the sum of its proper divisors (29959445840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20103131200 is a wasteful number, since it uses less digits than its factorization.
20103131200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151484 (or 151469 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 20103131200 its reverse (213130102), we get a palindrome (20316261302).
The spelling of 20103131200 in words is "twenty billion, one hundred three million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •