Base | Representation |
---|---|
bin | 1010100100000000001100… |
… | …0010110011010110010011 |
3 | 1112010020211201112101021012 |
4 | 2221000003002303112103 |
5 | 3010234220003302033 |
6 | 40411122254521135 |
7 | 2306025614415350 |
oct | 251000302632623 |
9 | 45106751471235 |
10 | 11613642634643 |
11 | 3778355555875 |
12 | 13769755061ab |
13 | 66321462892a |
14 | 2c2163669627 |
15 | 15216e0b9248 |
hex | a90030b3593 |
11613642634643 has 4 divisors (see below), whose sum is σ = 13272734439600. Its totient is φ = 9954550829688.
The previous prime is 11613642634603. The next prime is 11613642634651. The reversal of 11613642634643 is 34643624631611.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11613642634643 - 220 = 11613641586067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11613642634591 and 11613642634600.
It is not an unprimeable number, because it can be changed into a prime (11613642634603) 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 3 ways as a sum of consecutive naturals, for example, 829545902468 + ... + 829545902481.
It is an arithmetic number, because the mean of its divisors is an integer number (3318183609900).
Almost surely, 211613642634643 is an apocalyptic number.
11613642634643 is a deficient number, since it is larger than the sum of its proper divisors (1659091804957).
11613642634643 is an equidigital number, since it uses as much as digits as its factorization.
11613642634643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1659091804956.
The product of its digits is 4478976, while the sum is 50.
The spelling of 11613642634643 in words is "eleven trillion, six hundred thirteen billion, six hundred forty-two million, six hundred thirty-four thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •