Base | Representation |
---|---|
bin | 1010100011111111010010… |
… | …1111010110011101001101 |
3 | 1112010020012222222010110021 |
4 | 2220333310233112131031 |
5 | 3010233222034421131 |
6 | 40411042403142141 |
7 | 2306016641545042 |
oct | 250776457263515 |
9 | 45106188863407 |
10 | 11613402654541 |
11 | 3778242046206 |
12 | 1376909074951 |
13 | 6631a69b3b7c |
14 | 2c213d83b1c9 |
15 | 152157eb3e11 |
hex | a8ff4bd674d |
11613402654541 has 4 divisors (see below), whose sum is σ = 11614048327872. Its totient is φ = 11612756981212.
The previous prime is 11613402654533. The next prime is 11613402654571. The reversal of 11613402654541 is 14545620431611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11613402654541 - 23 = 11613402654533 is a prime.
It is a super-2 number, since 2×116134026545412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11613402654571) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 322809685 + ... + 322845658.
It is an arithmetic number, because the mean of its divisors is an integer number (2903512081968).
Almost surely, 211613402654541 is an apocalyptic number.
It is an amenable number.
11613402654541 is a deficient number, since it is larger than the sum of its proper divisors (645673331).
11613402654541 is an equidigital number, since it uses as much as digits as its factorization.
11613402654541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645673330.
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 11613402654541 in words is "eleven trillion, six hundred thirteen billion, four hundred two million, six hundred fifty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •