Base | Representation |
---|---|
bin | 101111111110111001010010… |
… | …010000001111110001111001 |
3 | 1000200012022002122221100011220 |
4 | 233332321102100033301321 |
5 | 210130010030044043223 |
6 | 2024453552145542253 |
7 | 62310302431641306 |
oct | 5776712220176171 |
9 | 1020168078840156 |
10 | 211030303112313 |
11 | 612714a3616033 |
12 | 1b803105644989 |
13 | 909a0c27c5609 |
14 | 3a17cc79880ad |
15 | 195e5b0c986e3 |
hex | bfee5240fc79 |
211030303112313 has 4 divisors (see below), whose sum is σ = 281373737483088. Its totient is φ = 140686868741540.
The previous prime is 211030303112311. The next prime is 211030303112383. The reversal of 211030303112313 is 313211303030112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 211030303112313 - 21 = 211030303112311 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211030303112311) 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, 35171717185383 + ... + 35171717185388.
It is an arithmetic number, because the mean of its divisors is an integer number (70343434370772).
Almost surely, 2211030303112313 is an apocalyptic number.
It is an amenable number.
211030303112313 is a deficient number, since it is larger than the sum of its proper divisors (70343434370775).
211030303112313 is an equidigital number, since it uses as much as digits as its factorization.
211030303112313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70343434370774.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 211030303112313 its reverse (313211303030112), we get a palindrome (524241606142425).
The spelling of 211030303112313 in words is "two hundred eleven trillion, thirty billion, three hundred three million, one hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •