Base | Representation |
---|---|
bin | 10110000101011001… |
… | …11101010011000101 |
3 | 1010121022002121020021 |
4 | 23002230331103011 |
5 | 143240230444114 |
6 | 5240301535141 |
7 | 566546405062 |
oct | 130254752305 |
9 | 33538077207 |
10 | 11856499909 |
11 | 5034759961 |
12 | 236a8744b1 |
13 | 116c500327 |
14 | 806945c69 |
15 | 495d77024 |
hex | 2c2b3d4c5 |
11856499909 has 24 divisors (see below), whose sum is σ = 13000197120. Its totient is φ = 10782434880.
The previous prime is 11856499901. The next prime is 11856499913. The reversal of 11856499909 is 90999465811.
11856499909 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11856499909 - 23 = 11856499901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11856499901) 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 23 ways as a sum of consecutive naturals, for example, 2316337 + ... + 2321449.
It is an arithmetic number, because the mean of its divisors is an integer number (541674880).
Almost surely, 211856499909 is an apocalyptic number.
11856499909 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
11856499909 is a deficient number, since it is larger than the sum of its proper divisors (1143697211).
11856499909 is a wasteful number, since it uses less digits than its factorization.
11856499909 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5321 (or 5290 counting only the distinct ones).
The product of its (nonzero) digits is 6298560, while the sum is 61.
The spelling of 11856499909 in words is "eleven billion, eight hundred fifty-six million, four hundred ninety-nine thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •