Base | Representation |
---|---|
bin | 10101111111101011… |
… | …11100101101000111 |
3 | 1010110221211020012111 |
4 | 22333311330231013 |
5 | 143140440301002 |
6 | 5231425401451 |
7 | 565424543650 |
oct | 127765745507 |
9 | 33427736174 |
10 | 11808525127 |
11 | 500a671783 |
12 | 2356799287 |
13 | 11625a3999 |
14 | 800418527 |
15 | 491a4c3d7 |
hex | 2bfd7cb47 |
11808525127 has 4 divisors (see below), whose sum is σ = 13495457296. Its totient is φ = 10121592960.
The previous prime is 11808525089. The next prime is 11808525143. The reversal of 11808525127 is 72152580811.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11808525127 - 27 = 11808524999 is a prime.
It is a super-2 number, since 2×118085251272 (a number of 21 digits) contains 22 as substring.
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 11808525127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11808525527) 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 3 ways as a sum of consecutive naturals, for example, 843466074 + ... + 843466087.
It is an arithmetic number, because the mean of its divisors is an integer number (3373864324).
Almost surely, 211808525127 is an apocalyptic number.
11808525127 is a deficient number, since it is larger than the sum of its proper divisors (1686932169).
11808525127 is an equidigital number, since it uses as much as digits as its factorization.
11808525127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1686932168.
The product of its (nonzero) digits is 44800, while the sum is 40.
The spelling of 11808525127 in words is "eleven billion, eight hundred eight million, five hundred twenty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •