Base | Representation |
---|---|
bin | 1100001110110011011… |
… | …0011001011011011001 |
3 | 202002101110122100202001 |
4 | 3003230312121123121 |
5 | 11420322310104423 |
6 | 240311112241001 |
7 | 21116161330246 |
oct | 3035466313331 |
9 | 662343570661 |
10 | 210132113113 |
11 | 811311107aa |
12 | 348849a0161 |
13 | 16a7a4b4b90 |
14 | a2559d45cd |
15 | 56ecc2bcad |
hex | 30ecd996d9 |
210132113113 has 8 divisors (see below), whose sum is σ = 236135083968. Its totient is φ = 185534708304.
The previous prime is 210132113111. The next prime is 210132113143. The reversal of 210132113113 is 311311231012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210132113113 - 21 = 210132113111 is a prime.
It is a super-2 number, since 2×2101321131132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210132113111) 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, 351391195 + ... + 351391792.
It is an arithmetic number, because the mean of its divisors is an integer number (29516885496).
Almost surely, 2210132113113 is an apocalyptic number.
210132113113 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
210132113113 is a deficient number, since it is larger than the sum of its proper divisors (26002970855).
210132113113 is a wasteful number, since it uses less digits than its factorization.
210132113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702783023.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 210132113113 its reverse (311311231012), we get a palindrome (521443344125).
The spelling of 210132113113 in words is "two hundred ten billion, one hundred thirty-two million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •