Base | Representation |
---|---|
bin | 110000000000010110011010… |
… | …100110110001000110000101 |
3 | 1000200112212012201000201012012 |
4 | 300000112122212301012011 |
5 | 210133124324103121201 |
6 | 2025011531004304005 |
7 | 62320442453601425 |
oct | 6000263246610605 |
9 | 1020485181021165 |
10 | 211130301223301 |
11 | 612aa948980969 |
12 | 1b81a572842005 |
13 | 90a666aac32a5 |
14 | 3a1ca92676485 |
15 | 1961eb4c5d5bb |
hex | c0059a9b1185 |
211130301223301 has 8 divisors (see below), whose sum is σ = 217943741412864. Its totient is φ = 204317035115760.
The previous prime is 211130301223183. The next prime is 211130301223339. The reversal of 211130301223301 is 103322103031112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211130301223301 - 210 = 211130301222277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211130301223351) 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, 41053505 + ... + 45909158.
It is an arithmetic number, because the mean of its divisors is an integer number (27242967676608).
Almost surely, 2211130301223301 is an apocalyptic number.
It is an amenable number.
211130301223301 is a deficient number, since it is larger than the sum of its proper divisors (6813440189563).
211130301223301 is an equidigital number, since it uses as much as digits as its factorization.
211130301223301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87041011.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 211130301223301 its reverse (103322103031112), we get a palindrome (314452404254413).
The spelling of 211130301223301 in words is "two hundred eleven trillion, one hundred thirty billion, three hundred one million, two hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •