Base | Representation |
---|---|
bin | 1100110110011111001000… |
… | …1111011000010011001111 |
3 | 1212000211112201221021121121 |
4 | 3031213302033120103033 |
5 | 3323002133124221021 |
6 | 50015155104341411 |
7 | 2655605546324653 |
oct | 315476217302317 |
9 | 55024481837547 |
10 | 14130211554511 |
11 | 4558653059858 |
12 | 1702643314867 |
13 | 7b661c8ca060 |
14 | 36bc97a86a63 |
15 | 19785c5ee741 |
hex | cd9f23d84cf |
14130211554511 has 4 divisors (see below), whose sum is σ = 15217150904872. Its totient is φ = 13043272204152.
The previous prime is 14130211554491. The next prime is 14130211554581. The reversal of 14130211554511 is 11545511203141.
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 14130211554511 - 25 = 14130211554479 is a prime.
It is a super-2 number, since 2×141302115545112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14130211554581) 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, 543469675161 + ... + 543469675186.
It is an arithmetic number, because the mean of its divisors is an integer number (3804287726218).
Almost surely, 214130211554511 is an apocalyptic number.
14130211554511 is a deficient number, since it is larger than the sum of its proper divisors (1086939350361).
14130211554511 is a wasteful number, since it uses less digits than its factorization.
14130211554511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1086939350360.
The product of its (nonzero) digits is 12000, while the sum is 34.
Adding to 14130211554511 its reverse (11545511203141), we get a palindrome (25675722757652).
The spelling of 14130211554511 in words is "fourteen trillion, one hundred thirty billion, two hundred eleven million, five hundred fifty-four thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •