Base | Representation |
---|---|
bin | 110000000000010110010110… |
… | …011010111010000100111100 |
3 | 1000200112212000210220021110220 |
4 | 300000112112122322010330 |
5 | 210133124203114134000 |
6 | 2025011520015301340 |
7 | 62320440642010002 |
oct | 6000262632720474 |
9 | 1020485023807426 |
10 | 211130231005500 |
11 | 612aa912281224 |
12 | 1b81a55321a850 |
13 | 90a66593a95b1 |
14 | 3a1ca871d8a72 |
15 | 1961ead9dd1a0 |
hex | c005966ba13c |
211130231005500 has 96 divisors (see below), whose sum is σ = 615724773867840. Its totient is φ = 56217737318400.
The previous prime is 211130231005469. The next prime is 211130231005501. The reversal of 211130231005500 is 5500132031112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211130231005501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 103562185 + ... + 105581184.
It is an arithmetic number, because the mean of its divisors is an integer number (6413799727790).
Almost surely, 2211130231005500 is an apocalyptic number.
211130231005500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211130231005500 is an abundant number, since it is smaller than the sum of its proper divisors (404594542862340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211130231005500 is a wasteful number, since it uses less digits than its factorization.
211130231005500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209144064 (or 209144052 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 211130231005500 its reverse (5500132031112), we get a palindrome (216630363036612).
The spelling of 211130231005500 in words is "two hundred eleven trillion, one hundred thirty billion, two hundred thirty-one million, five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •