Base | Representation |
---|---|
bin | 1011110111110111100010… |
… | …1110011100001100010111 |
3 | 1201012222202202010111022101 |
4 | 2331331320232130030113 |
5 | 3202340433322140232 |
6 | 43433042310542531 |
7 | 2515102654043632 |
oct | 275757056341427 |
9 | 51188682114271 |
10 | 13054431052567 |
11 | 4183398001163 |
12 | 156a052667a47 |
13 | 739048741228 |
14 | 331ba3034c19 |
15 | 17989804b1e7 |
hex | bdf78b9c317 |
13054431052567 has 2 divisors, whose sum is σ = 13054431052568. Its totient is φ = 13054431052566.
The previous prime is 13054431052519. The next prime is 13054431052577. The reversal of 13054431052567 is 76525013445031.
It is a strong prime.
It is an emirp because it is prime and its reverse (76525013445031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13054431052567 - 235 = 13020071314199 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13054431052577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6527215526283 + 6527215526284.
It is an arithmetic number, because the mean of its divisors is an integer number (6527215526284).
Almost surely, 213054431052567 is an apocalyptic number.
13054431052567 is a deficient number, since it is larger than the sum of its proper divisors (1).
13054431052567 is an equidigital number, since it uses as much as digits as its factorization.
13054431052567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512000, while the sum is 46.
Adding to 13054431052567 its reverse (76525013445031), we get a palindrome (89579444497598).
The spelling of 13054431052567 in words is "thirteen trillion, fifty-four billion, four hundred thirty-one million, fifty-two thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •