Base | Representation |
---|---|
bin | 1100010100101110001100… |
… | …0000110110001000001001 |
3 | 1202222101021020111121000022 |
4 | 3011023203000312020021 |
5 | 3234001134142020241 |
6 | 44452502445350225 |
7 | 2565651663246266 |
oct | 305134300661011 |
9 | 52871236447008 |
10 | 13550135501321 |
11 | 435464226a401 |
12 | 162a134b68375 |
13 | 773a069696b3 |
14 | 34bb8996c26d |
15 | 18770b9c854b |
hex | c52e3036209 |
13550135501321 has 2 divisors, whose sum is σ = 13550135501322. Its totient is φ = 13550135501320.
The previous prime is 13550135501317. The next prime is 13550135501369. The reversal of 13550135501321 is 12310553105531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9467553609721 + 4082581891600 = 3076939^2 + 2020540^2 .
It is a cyclic number.
It is not a de Polignac number, because 13550135501321 - 22 = 13550135501317 is a prime.
It is not a weakly prime, because it can be changed into another prime (13550135551321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6775067750660 + 6775067750661.
It is an arithmetic number, because the mean of its divisors is an integer number (6775067750661).
Almost surely, 213550135501321 is an apocalyptic number.
It is an amenable number.
13550135501321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13550135501321 is an equidigital number, since it uses as much as digits as its factorization.
13550135501321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33750, while the sum is 35.
Adding to 13550135501321 its reverse (12310553105531), we get a palindrome (25860688606852).
The spelling of 13550135501321 in words is "thirteen trillion, five hundred fifty billion, one hundred thirty-five million, five hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •