Base | Representation |
---|---|
bin | 10110001011111011… |
… | …01010000001000111 |
3 | 1010202010001010001001 |
4 | 23011331222001013 |
5 | 143343232142111 |
6 | 5245534314131 |
7 | 601112414641 |
oct | 130575520107 |
9 | 33663033031 |
10 | 11911209031 |
11 | 5062626707 |
12 | 2385058947 |
13 | 117a946ca7 |
14 | 80dd07891 |
15 | 49aa821c1 |
hex | 2c5f6a047 |
11911209031 has 8 divisors (see below), whose sum is σ = 12095564624. Its totient is φ = 11727426240.
The previous prime is 11911209007. The next prime is 11911209073. The reversal of 11911209031 is 13090211911.
11911209031 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 a de Polignac number, because none of the positive numbers 2k-11911209031 is a prime.
It is a super-2 number, since 2×119112090312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11911200031) 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, 101196 + ... + 184561.
It is an arithmetic number, because the mean of its divisors is an integer number (1511945578).
Almost surely, 211911209031 is an apocalyptic number.
11911209031 is a deficient number, since it is larger than the sum of its proper divisors (184355593).
11911209031 is an equidigital number, since it uses as much as digits as its factorization.
11911209031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286401.
The product of its (nonzero) digits is 486, while the sum is 28.
The spelling of 11911209031 in words is "eleven billion, nine hundred eleven million, two hundred nine thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •