Base | Representation |
---|---|
bin | 1011111100111010111100… |
… | …1100011001001100110011 |
3 | 1201112021211220102100021201 |
4 | 2333032233030121030303 |
5 | 3210301232010021321 |
6 | 43541000530232031 |
7 | 2524265165562022 |
oct | 277165714311463 |
9 | 51467756370251 |
10 | 13141244220211 |
11 | 42071968529a8 |
12 | 1582a40125617 |
13 | 7442a2255293 |
14 | 33607a9b48b9 |
15 | 17bc7972b291 |
hex | bf3af319333 |
13141244220211 has 8 divisors (see below), whose sum is σ = 13877814746880. Its totient is φ = 12418441367112.
The previous prime is 13141244220197. The next prime is 13141244220271. The reversal of 13141244220211 is 11202244214131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13141244220211 - 29 = 13141244219699 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13141244220211.
It is not an unprimeable number, because it can be changed into a prime (13141244220271) 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, 3441916431 + ... + 3441920248.
It is an arithmetic number, because the mean of its divisors is an integer number (1734726843360).
Almost surely, 213141244220211 is an apocalyptic number.
13141244220211 is a deficient number, since it is larger than the sum of its proper divisors (736570526669).
13141244220211 is an equidigital number, since it uses as much as digits as its factorization.
13141244220211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6883836785.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 13141244220211 its reverse (11202244214131), we get a palindrome (24343488434342).
The spelling of 13141244220211 in words is "thirteen trillion, one hundred forty-one billion, two hundred forty-four million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •