Base | Representation |
---|---|
bin | 1100010011001001111… |
… | …0011010001110001111 |
3 | 202012101212122211220121 |
4 | 3010302132122032033 |
5 | 11430220324330111 |
6 | 241023041125411 |
7 | 21160134215032 |
oct | 3046236321617 |
9 | 665355584817 |
10 | 211300230031 |
11 | 81680520290 |
12 | 34b50029867 |
13 | 16c054c5217 |
14 | a326bc5019 |
15 | 576a56a871 |
hex | 313279a38f |
211300230031 has 4 divisors (see below), whose sum is σ = 230509341864. Its totient is φ = 192091118200.
The previous prime is 211300230019. The next prime is 211300230061. The reversal of 211300230031 is 130032003112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211300230031 - 215 = 211300197263 is a prime.
It is a super-2 number, since 2×2113002300312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211300229987 and 211300230014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211300230061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9604555900 + ... + 9604555921.
It is an arithmetic number, because the mean of its divisors is an integer number (57627335466).
Almost surely, 2211300230031 is an apocalyptic number.
211300230031 is a deficient number, since it is larger than the sum of its proper divisors (19209111833).
211300230031 is a wasteful number, since it uses less digits than its factorization.
211300230031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19209111832.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 211300230031 its reverse (130032003112), we get a palindrome (341332233143).
The spelling of 211300230031 in words is "two hundred eleven billion, three hundred million, two hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •