Base | Representation |
---|---|
bin | 10101111001100001… |
… | …10100011101110101 |
3 | 1010100100120210220100 |
4 | 22330300310131311 |
5 | 143034223132023 |
6 | 5222342024313 |
7 | 564226365510 |
oct | 127460643565 |
9 | 33310523810 |
10 | 11756849013 |
11 | 4a93486748 |
12 | 2341418099 |
13 | 115497c6c0 |
14 | 7d7605d77 |
15 | 48c240c43 |
hex | 2bcc34775 |
11756849013 has 96 divisors (see below), whose sum is σ = 22230790400. Its totient is φ = 5813710848.
The previous prime is 11756849011. The next prime is 11756849029. The reversal of 11756849013 is 31094865711.
It is not a de Polignac number, because 11756849013 - 21 = 11756849011 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11756849013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11756849011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1505523 + ... + 1513311.
Almost surely, 211756849013 is an apocalyptic number.
11756849013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11756849013 is a deficient number, since it is larger than the sum of its proper divisors (10473941387).
11756849013 is a wasteful number, since it uses less digits than its factorization.
11756849013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7931 (or 7928 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 45.
The spelling of 11756849013 in words is "eleven billion, seven hundred fifty-six million, eight hundred forty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •