Base | Representation |
---|---|
bin | 1011111100100011110110… |
… | …1101111110000111010111 |
3 | 1201111200211220100022020001 |
4 | 2333020331231332013113 |
5 | 3210201033113432442 |
6 | 43534053453152131 |
7 | 2523655446120145 |
oct | 277107555760727 |
9 | 51450756308201 |
10 | 13135045452247 |
11 | 42045a5800874 |
12 | 15817b018b647 |
13 | 743824c43c44 |
14 | 335a4d624595 |
15 | 17ba1542e2b7 |
hex | bf23db7e1d7 |
13135045452247 has 2 divisors, whose sum is σ = 13135045452248. Its totient is φ = 13135045452246.
The previous prime is 13135045452173. The next prime is 13135045452293. The reversal of 13135045452247 is 74225454053131.
It is an a-pointer prime, because the next prime (13135045452293) can be obtained adding 13135045452247 to its sum of digits (46).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13135045452247 - 27 = 13135045452119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13135045452197 and 13135045452206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13135045452047) 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 as a sum of consecutive naturals, namely, 6567522726123 + 6567522726124.
It is an arithmetic number, because the mean of its divisors is an integer number (6567522726124).
Almost surely, 213135045452247 is an apocalyptic number.
13135045452247 is a deficient number, since it is larger than the sum of its proper divisors (1).
13135045452247 is an equidigital number, since it uses as much as digits as its factorization.
13135045452247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016000, while the sum is 46.
The spelling of 13135045452247 in words is "thirteen trillion, one hundred thirty-five billion, forty-five million, four hundred fifty-two thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •