Base | Representation |
---|---|
bin | 1100000000111111010101… |
… | …1010100100000101101001 |
3 | 1201202222021012002010220222 |
4 | 3000033311122210011221 |
5 | 3212422404301113211 |
6 | 44033040442255425 |
7 | 2532321260416064 |
oct | 300176532440551 |
9 | 51688235063828 |
10 | 13211141816681 |
11 | 42338a5161756 |
12 | 15944a87b7575 |
13 | 74aa613c7113 |
14 | 3395cbb718db |
15 | 17d9bad601db |
hex | c03f56a4169 |
13211141816681 has 4 divisors (see below), whose sum is σ = 13211227343952. Its totient is φ = 13211056289412.
The previous prime is 13211141816597. The next prime is 13211141816771. The reversal of 13211141816681 is 18661814111231.
It is a happy number.
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 13211141816681 - 218 = 13211141554537 is a prime.
It is a super-2 number, since 2×132111418166812 (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 (13211141816981) 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, 42531515 + ... + 42841008.
It is an arithmetic number, because the mean of its divisors is an integer number (3302806835988).
Almost surely, 213211141816681 is an apocalyptic number.
It is an amenable number.
13211141816681 is a deficient number, since it is larger than the sum of its proper divisors (85527271).
13211141816681 is an equidigital number, since it uses as much as digits as its factorization.
13211141816681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85527270.
The product of its digits is 55296, while the sum is 44.
The spelling of 13211141816681 in words is "thirteen trillion, two hundred eleven billion, one hundred forty-one million, eight hundred sixteen thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •