Base | Representation |
---|---|
bin | 1100010010000000101001… |
… | …0100001001101010011001 |
3 | 1202210221000122002202222001 |
4 | 3010200022110021222121 |
5 | 3232220232324430431 |
6 | 44415240105401001 |
7 | 2562412364066215 |
oct | 304401224115231 |
9 | 52727018082861 |
10 | 13503550233241 |
11 | 4336907084a52 |
12 | 16210b3799161 |
13 | 76c4c14b0103 |
14 | 34980a961945 |
15 | 1863d1ceae61 |
hex | c480a509a99 |
13503550233241 has 2 divisors, whose sum is σ = 13503550233242. Its totient is φ = 13503550233240.
The previous prime is 13503550233113. The next prime is 13503550233281. The reversal of 13503550233241 is 14233205530531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12816607640841 + 686942592400 = 3580029^2 + 828820^2 .
It is a cyclic number.
It is not a de Polignac number, because 13503550233241 - 27 = 13503550233113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13503550233241.
It is not a weakly prime, because it can be changed into another prime (13503550233281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6751775116620 + 6751775116621.
It is an arithmetic number, because the mean of its divisors is an integer number (6751775116621).
Almost surely, 213503550233241 is an apocalyptic number.
It is an amenable number.
13503550233241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13503550233241 is an equidigital number, since it uses as much as digits as its factorization.
13503550233241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162000, while the sum is 37.
Adding to 13503550233241 its reverse (14233205530531), we get a palindrome (27736755763772).
The spelling of 13503550233241 in words is "thirteen trillion, five hundred three billion, five hundred fifty million, two hundred thirty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •