Base | Representation |
---|---|
bin | 1100001001010111010000… |
… | …0110010010110101001001 |
3 | 1202021201120222202110201002 |
4 | 3002111310012102311021 |
5 | 3222302020242132223 |
6 | 44223111450504345 |
7 | 2545603243412453 |
oct | 302256406226511 |
9 | 52251528673632 |
10 | 13355001130313 |
11 | 4289907a79297 |
12 | 15b8356a350b5 |
13 | 75b4a96bcc3b |
14 | 342557b712d3 |
15 | 1825da7b6e28 |
hex | c2574192d49 |
13355001130313 has 2 divisors, whose sum is σ = 13355001130314. Its totient is φ = 13355001130312.
The previous prime is 13355001130307. The next prime is 13355001130363. The reversal of 13355001130313 is 31303110055331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9883050887824 + 3471950242489 = 3143732^2 + 1863317^2 .
It is a cyclic number.
It is not a de Polignac number, because 13355001130313 - 24 = 13355001130297 is a prime.
It is not a weakly prime, because it can be changed into another prime (13355001130363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6677500565156 + 6677500565157.
It is an arithmetic number, because the mean of its divisors is an integer number (6677500565157).
Almost surely, 213355001130313 is an apocalyptic number.
It is an amenable number.
13355001130313 is a deficient number, since it is larger than the sum of its proper divisors (1).
13355001130313 is an equidigital number, since it uses as much as digits as its factorization.
13355001130313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6075, while the sum is 29.
Adding to 13355001130313 its reverse (31303110055331), we get a palindrome (44658111185644).
The spelling of 13355001130313 in words is "thirteen trillion, three hundred fifty-five billion, one million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.011 sec. • engine limits •