Base | Representation |
---|---|
bin | 110000001101001010110100… |
… | …010101111110000100100111 |
3 | 1000210200001222010222100020220 |
4 | 300031022310111332010213 |
5 | 210242042420014321203 |
6 | 2030524333514455423 |
7 | 62441206132111344 |
oct | 6015126425760447 |
9 | 1023601863870226 |
10 | 212011201323303 |
11 | 6160a49a032138 |
12 | 1b941236434573 |
13 | 913b755504805 |
14 | 3a4d57b11b7cb |
15 | 1979d7056a653 |
hex | c0d2b457e127 |
212011201323303 has 8 divisors (see below), whose sum is σ = 282682215423216. Its totient is φ = 141340494052800.
The previous prime is 212011201323239. The next prime is 212011201323329. The reversal of 212011201323303 is 303323102110212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212011201323303 - 26 = 212011201323239 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212011201323343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75090208 + ... + 77862453.
It is an arithmetic number, because the mean of its divisors is an integer number (35335276927902).
Almost surely, 2212011201323303 is an apocalyptic number.
212011201323303 is a deficient number, since it is larger than the sum of its proper divisors (70671014099913).
212011201323303 is a wasteful number, since it uses less digits than its factorization.
212011201323303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153414705.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 212011201323303 its reverse (303323102110212), we get a palindrome (515334303433515).
The spelling of 212011201323303 in words is "two hundred twelve trillion, eleven billion, two hundred one million, three hundred twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •