Base | Representation |
---|---|
bin | 11111000000110000001… |
… | …111011011100011011000 |
3 | 21112201202221022222011100 |
4 | 133000300033123203120 |
5 | 234404004430131300 |
6 | 4311004142231400 |
7 | 306652653502665 |
oct | 37006017334330 |
9 | 7481687288140 |
10 | 2131113130200 |
11 | 75188889312a |
12 | 2a5035585560 |
13 | 125c69c36112 |
14 | 75209b14a6c |
15 | 3a67d91c700 |
hex | 1f0303db8d8 |
2131113130200 has 144 divisors (see below), whose sum is σ = 7157862883080. Its totient is φ = 568227386880.
The previous prime is 2131113130177. The next prime is 2131113130207. The reversal of 2131113130200 is 20313111312.
2131113130200 is a `hidden beast` number, since 21 + 311 + 1 + 3 + 130 + 200 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131113130207) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 15604612 + ... + 15740588.
Almost surely, 22131113130200 is an apocalyptic number.
2131113130200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2131113130200 is an abundant number, since it is smaller than the sum of its proper divisors (5026749752880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2131113130200 is a wasteful number, since it uses less digits than its factorization.
2131113130200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144706 (or 144694 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2131113130200 its reverse (20313111312), we get a palindrome (2151426241512).
The spelling of 2131113130200 in words is "two trillion, one hundred thirty-one billion, one hundred thirteen million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •