Base | Representation |
---|---|
bin | 1010011110000111100010… |
… | …0100010010010011010111 |
3 | 1111202120212100221001010001 |
4 | 2213201320210102103113 |
5 | 3002110132443200401 |
6 | 40252441410112131 |
7 | 2265516232003312 |
oct | 247417044222327 |
9 | 44676770831101 |
10 | 11512535131351 |
11 | 3739490a500a1 |
12 | 135b25887b647 |
13 | 65682053c1c7 |
14 | 2bb2d14b5979 |
15 | 14e702a15601 |
hex | a78789124d7 |
11512535131351 has 8 divisors (see below), whose sum is σ = 12209061226464. Its totient is φ = 10818155496960.
The previous prime is 11512535131327. The next prime is 11512535131367. The reversal of 11512535131351 is 15313153521511.
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 11512535131351 - 217 = 11512535000279 is a prime.
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 11512535131351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11512535135351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 536604130 + ... + 536625583.
It is an arithmetic number, because the mean of its divisors is an integer number (1526132653308).
Almost surely, 211512535131351 is an apocalyptic number.
11512535131351 is a deficient number, since it is larger than the sum of its proper divisors (696526095113).
11512535131351 is a wasteful number, since it uses less digits than its factorization.
11512535131351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073230361.
The product of its digits is 33750, while the sum is 37.
Adding to 11512535131351 its reverse (15313153521511), we get a palindrome (26825688652862).
The spelling of 11512535131351 in words is "eleven trillion, five hundred twelve billion, five hundred thirty-five million, one hundred thirty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •