Base | Representation |
---|---|
bin | 1100010010110111011… |
… | …1110011110011000111 |
3 | 202012012111100021101200 |
4 | 3010231313303303013 |
5 | 11430041042033221 |
6 | 241011241553543 |
7 | 21155205616236 |
oct | 3045567636307 |
9 | 665174307350 |
10 | 211223002311 |
11 | 81640972a22 |
12 | 34b2a1a58b3 |
13 | 16bc24c5949 |
14 | a31a840b1d |
15 | 57638b3426 |
hex | 312ddf3cc7 |
211223002311 has 12 divisors (see below), whose sum is σ = 305415416592. Its totient is φ = 140669708256.
The previous prime is 211223002307. The next prime is 211223002321. The reversal of 211223002311 is 113200322112.
211223002311 is a `hidden beast` number, since 211 + 223 + 0 + 0 + 231 + 1 = 666.
It is not a de Polignac number, because 211223002311 - 22 = 211223002307 is a prime.
It is a super-2 number, since 2×2112230023112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211223002321) 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 11 ways as a sum of consecutive naturals, for example, 12126366 + ... + 12143771.
It is an arithmetic number, because the mean of its divisors is an integer number (25451284716).
Almost surely, 2211223002311 is an apocalyptic number.
211223002311 is a deficient number, since it is larger than the sum of its proper divisors (94192414281).
211223002311 is a wasteful number, since it uses less digits than its factorization.
211223002311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24271110 (or 24271107 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 211223002311 its reverse (113200322112), we get a palindrome (324423324423).
The spelling of 211223002311 in words is "two hundred eleven billion, two hundred twenty-three million, two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •