Base | Representation |
---|---|
bin | 1011111101101011110001… |
… | …1100100001000000110101 |
3 | 1201120112200100222201101211 |
4 | 2333122330130201000311 |
5 | 3211010102432432323 |
6 | 43551005311521421 |
7 | 2525241043322266 |
oct | 277327434410065 |
9 | 51515610881354 |
10 | 13154351452213 |
11 | 4211802509344 |
12 | 1585499829271 |
13 | 7455b090046a |
14 | 33696169496d |
15 | 17c2952b070d |
hex | bf6bc721035 |
13154351452213 has 2 divisors, whose sum is σ = 13154351452214. Its totient is φ = 13154351452212.
The previous prime is 13154351452201. The next prime is 13154351452223. The reversal of 13154351452213 is 31225415345131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12880468789969 + 273882662244 = 3588937^2 + 523338^2 .
It is a cyclic number.
It is not a de Polignac number, because 13154351452213 - 213 = 13154351444021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13154351452223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6577175726106 + 6577175726107.
It is an arithmetic number, because the mean of its divisors is an integer number (6577175726107).
Almost surely, 213154351452213 is an apocalyptic number.
It is an amenable number.
13154351452213 is a deficient number, since it is larger than the sum of its proper divisors (1).
13154351452213 is an equidigital number, since it uses as much as digits as its factorization.
13154351452213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 216000, while the sum is 40.
Adding to 13154351452213 its reverse (31225415345131), we get a palindrome (44379766797344).
The spelling of 13154351452213 in words is "thirteen trillion, one hundred fifty-four billion, three hundred fifty-one million, four hundred fifty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •