Base | Representation |
---|---|
bin | 1011111100111011001101… |
… | …0111011000111001011111 |
3 | 1201112022000210010021011211 |
4 | 2333032303113120321133 |
5 | 3210301402414231143 |
6 | 43541011510325251 |
7 | 2524300005521026 |
oct | 277166327307137 |
9 | 51468023107154 |
10 | 13141314211423 |
11 | 4207222308382 |
12 | 1582a5b659827 |
13 | 7442b38bcab8 |
14 | 336085dd38bd |
15 | 17bc8095449d |
hex | bf3b35d8e5f |
13141314211423 has 4 divisors (see below), whose sum is σ = 13141758669760. Its totient is φ = 13140869753088.
The previous prime is 13141314211393. The next prime is 13141314211433. The reversal of 13141314211423 is 32411241314131.
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 13141314211423 - 29 = 13141314210911 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13141314211433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 222184815 + ... + 222243952.
It is an arithmetic number, because the mean of its divisors is an integer number (3285439667440).
Almost surely, 213141314211423 is an apocalyptic number.
13141314211423 is a deficient number, since it is larger than the sum of its proper divisors (444458337).
13141314211423 is an equidigital number, since it uses as much as digits as its factorization.
13141314211423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444458336.
The product of its digits is 6912, while the sum is 31.
Adding to 13141314211423 its reverse (32411241314131), we get a palindrome (45552555525554).
The spelling of 13141314211423 in words is "thirteen trillion, one hundred forty-one billion, three hundred fourteen million, two hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •