Base | Representation |
---|---|
bin | 1010011110001001110111… |
… | …1010010011100000000101 |
3 | 1111202122111000212000102102 |
4 | 2213202131322103200011 |
5 | 3002112423341113141 |
6 | 40253023510521445 |
7 | 2265540610263551 |
oct | 247423572234005 |
9 | 44678430760372 |
10 | 11513161660421 |
11 | 3739782678713 |
12 | 135b3b2666285 |
13 | 6568c0295c75 |
14 | 2bb3507a6861 |
15 | 14e73ca2399b |
hex | a789de93805 |
11513161660421 has 4 divisors (see below), whose sum is σ = 11514834362592. Its totient is φ = 11511488958252.
The previous prime is 11513161660417. The next prime is 11513161660453. The reversal of 11513161660421 is 12406616131511.
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 11513161660421 - 22 = 11513161660417 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 (11513161680421) 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, 836340761 + ... + 836354526.
It is an arithmetic number, because the mean of its divisors is an integer number (2878708590648).
Almost surely, 211513161660421 is an apocalyptic number.
It is an amenable number.
11513161660421 is a deficient number, since it is larger than the sum of its proper divisors (1672702171).
11513161660421 is an equidigital number, since it uses as much as digits as its factorization.
11513161660421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1672702170.
The product of its (nonzero) digits is 25920, while the sum is 38.
Adding to 11513161660421 its reverse (12406616131511), we get a palindrome (23919777791932).
The spelling of 11513161660421 in words is "eleven trillion, five hundred thirteen billion, one hundred sixty-one million, six hundred sixty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •