Base | Representation |
---|---|
bin | 1100010010001010001… |
… | …1011001010000000001 |
3 | 202011201021000022012101 |
4 | 3010202203121100001 |
5 | 11424143433220223 |
6 | 240540335430401 |
7 | 21150411523066 |
oct | 3044243312001 |
9 | 664637008171 |
10 | 211033101313 |
11 | 81553758551 |
12 | 34a96685401 |
13 | 16b920662a8 |
14 | a2dd52ac6d |
15 | 5751da14ad |
hex | 31228d9401 |
211033101313 has 8 divisors (see below), whose sum is σ = 220299846336. Its totient is φ = 201773972400.
The previous prime is 211033101299. The next prime is 211033101319. The reversal of 211033101313 is 313101330112.
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 211033101313 - 225 = 210999546881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211033101319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1847358 + ... + 1958263.
It is an arithmetic number, because the mean of its divisors is an integer number (27537480792).
Almost surely, 2211033101313 is an apocalyptic number.
211033101313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
211033101313 is a deficient number, since it is larger than the sum of its proper divisors (9266745023).
211033101313 is a wasteful number, since it uses less digits than its factorization.
211033101313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3808055.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 211033101313 its reverse (313101330112), we get a palindrome (524134431425).
The spelling of 211033101313 in words is "two hundred eleven billion, thirty-three million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •