Base | Representation |
---|---|
bin | 1100010011001111100… |
… | …1011101111011011001 |
3 | 202012110112120120210010 |
4 | 3010303321131323121 |
5 | 11430242432202223 |
6 | 241025252512133 |
7 | 21160544133504 |
oct | 3046371357331 |
9 | 665415516703 |
10 | 211324100313 |
11 | 81692a44397 |
12 | 34b5801b649 |
13 | 16c0a432151 |
14 | a32a03a13b |
15 | 576c6d3393 |
hex | 3133e5ded9 |
211324100313 has 8 divisors (see below), whose sum is σ = 281767653376. Its totient is φ = 140881640400.
The previous prime is 211324100287. The next prime is 211324100333. The reversal of 211324100313 is 313001423112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211324100313 - 230 = 210250358489 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 211324100313.
It is not an unprimeable number, because it can be changed into a prime (211324100333) 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, 455208 + ... + 793638.
It is an arithmetic number, because the mean of its divisors is an integer number (35220956672).
Almost surely, 2211324100313 is an apocalyptic number.
It is an amenable number.
211324100313 is a deficient number, since it is larger than the sum of its proper divisors (70443553063).
211324100313 is a wasteful number, since it uses less digits than its factorization.
211324100313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546575.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 211324100313 its reverse (313001423112), we get a palindrome (524325523425).
The spelling of 211324100313 in words is "two hundred eleven billion, three hundred twenty-four million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •