Base | Representation |
---|---|
bin | 10010101110001111… |
… | …010110111101111000 |
3 | 1220220000120212101102 |
4 | 102232033112331320 |
5 | 312132400143000 |
6 | 13122451510532 |
7 | 1311113536241 |
oct | 225617267570 |
9 | 56800525342 |
10 | 20103131000 |
11 | 8586769957 |
12 | 3a905b8448 |
13 | 1b84b765b4 |
14 | d89c8dcc8 |
15 | 7c9d3d3d5 |
hex | 4ae3d6f78 |
20103131000 has 64 divisors (see below), whose sum is σ = 47163168000. Its totient is φ = 8020425600.
The previous prime is 20103130997. The next prime is 20103131017. The reversal of 20103131000 is 13130102.
It is a super-2 number, since 2×201031310002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 363161 + ... + 414839.
It is an arithmetic number, because the mean of its divisors is an integer number (736924500).
Almost surely, 220103131000 is an apocalyptic number.
20103131000 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 20103131000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23581584000).
20103131000 is an abundant number, since it is smaller than the sum of its proper divisors (27060037000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20103131000 is a wasteful number, since it uses less digits than its factorization.
20103131000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52089 (or 52075 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 20103131000 its reverse (13130102), we get a palindrome (20116261102).
The spelling of 20103131000 in words is "twenty billion, one hundred three million, one hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •