Base | Representation |
---|---|
bin | 10100111100010110… |
… | …00011111000100011 |
3 | 1002000120212210112201 |
4 | 22132023003320203 |
5 | 141011332243321 |
6 | 5055410034031 |
7 | 545425212445 |
oct | 123613037043 |
9 | 32016783481 |
10 | 11243634211 |
11 | 484a813887 |
12 | 2219578917 |
13 | 10a254b6c4 |
14 | 7893b0495 |
15 | 45c167291 |
hex | 29e2c3e23 |
11243634211 has 8 divisors (see below), whose sum is σ = 11372737248. Its totient is φ = 11114880000.
The previous prime is 11243634113. The next prime is 11243634223.
11243634211 is nontrivially palindromic in base 10.
11243634211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11243634211 - 29 = 11243633699 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11243634211.
It is not an unprimeable number, because it can be changed into a prime (11243634271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22095 + ... + 151576.
It is an arithmetic number, because the mean of its divisors is an integer number (1421592156).
Almost surely, 211243634211 is an apocalyptic number.
11243634211 is a deficient number, since it is larger than the sum of its proper divisors (129103037).
11243634211 is a wasteful number, since it uses less digits than its factorization.
11243634211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174413.
The product of its digits is 3456, while the sum is 28.
The spelling of 11243634211 in words is "eleven billion, two hundred forty-three million, six hundred thirty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •