Base | Representation |
---|---|
bin | 101111111110111011001011… |
… | …000101011001011000101011 |
3 | 1000200012111022221110201021120 |
4 | 233332323023011121120223 |
5 | 210130023203024424321 |
6 | 2024454525243510323 |
7 | 62310403605564213 |
oct | 5776731305313053 |
9 | 1020174287421246 |
10 | 211032330311211 |
11 | 6127234394a622 |
12 | 1b8035905283a3 |
13 | 909a3567a39a6 |
14 | 3a1803acc3243 |
15 | 195e67dc2eec6 |
hex | bfeecb15962b |
211032330311211 has 16 divisors (see below), whose sum is σ = 284131128902400. Its totient is φ = 139311095948640.
The previous prime is 211032330311111. The next prime is 211032330311233. The reversal of 211032330311211 is 112113033230112.
It is not a de Polignac number, because 211032330311211 - 27 = 211032330311083 is a prime.
It is a super-2 number, since 2×2110323303112112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211032330311281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23653761 + ... + 31329938.
It is an arithmetic number, because the mean of its divisors is an integer number (17758195556400).
Almost surely, 2211032330311211 is an apocalyptic number.
211032330311211 is a deficient number, since it is larger than the sum of its proper divisors (73098798591189).
211032330311211 is a wasteful number, since it uses less digits than its factorization.
211032330311211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54996226.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 211032330311211 its reverse (112113033230112), we get a palindrome (323145363541323).
The spelling of 211032330311211 in words is "two hundred eleven trillion, thirty-two billion, three hundred thirty million, three hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •