Base | Representation |
---|---|
bin | 10110000100001111… |
… | …10010011011011001 |
3 | 1010120121202120011212 |
4 | 23002013302123121 |
5 | 143230232143212 |
6 | 5235313032505 |
7 | 566400523253 |
oct | 130207623331 |
9 | 33517676155 |
10 | 11846756057 |
11 | 502a204194 |
12 | 2367555735 |
13 | 116a49b236 |
14 | 80552acd3 |
15 | 49509ee22 |
hex | 2c21f26d9 |
11846756057 has 8 divisors (see below), whose sum is σ = 11894074752. Its totient is φ = 11799464400.
The previous prime is 11846756021. The next prime is 11846756069. The reversal of 11846756057 is 75065764811.
It is a happy number.
11846756057 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 11846756057 - 214 = 11846739673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11846755996 and 11846756014.
It is not an unprimeable number, because it can be changed into a prime (11846756657) 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, 1682378 + ... + 1689404.
It is an arithmetic number, because the mean of its divisors is an integer number (1486759344).
Almost surely, 211846756057 is an apocalyptic number.
It is an amenable number.
11846756057 is a deficient number, since it is larger than the sum of its proper divisors (47318695).
11846756057 is an equidigital number, since it uses as much as digits as its factorization.
11846756057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13519.
The product of its (nonzero) digits is 1411200, while the sum is 50.
The spelling of 11846756057 in words is "eleven billion, eight hundred forty-six million, seven hundred fifty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •