Base | Representation |
---|---|
bin | 1011111110001101100100… |
… | …0111011110111101000011 |
3 | 1201121102002112121020210001 |
4 | 2333203121013132331003 |
5 | 3211132142114200421 |
6 | 43555105350020431 |
7 | 2526011610240052 |
oct | 277433107367503 |
9 | 51542075536701 |
10 | 13163422412611 |
11 | 4215637867129 |
12 | 15871ab647717 |
13 | 7463c7c97453 |
14 | 33718229c399 |
15 | 17c626807691 |
hex | bf8d91def43 |
13163422412611 has 8 divisors (see below), whose sum is σ = 13360065675264. Its totient is φ = 12966784275720.
The previous prime is 13163422412527. The next prime is 13163422412629. The reversal of 13163422412611 is 11621422436131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13163422412611 is a prime.
It is a super-2 number, since 2×131634224126112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13163422412411) 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, 4058046 + ... + 6541756.
It is an arithmetic number, because the mean of its divisors is an integer number (1670008209408).
Almost surely, 213163422412611 is an apocalyptic number.
13163422412611 is a deficient number, since it is larger than the sum of its proper divisors (196643262653).
13163422412611 is an equidigital number, since it uses as much as digits as its factorization.
13163422412611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2562881.
The product of its digits is 41472, while the sum is 37.
Adding to 13163422412611 its reverse (11621422436131), we get a palindrome (24784844848742).
The spelling of 13163422412611 in words is "thirteen trillion, one hundred sixty-three billion, four hundred twenty-two million, four hundred twelve thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •