Base | Representation |
---|---|
bin | 1100000010101100000101… |
… | …1001111111101010010001 |
3 | 1201212202121122100220010012 |
4 | 3000223001121333222101 |
5 | 3213412201002221223 |
6 | 44054305300444305 |
7 | 2534403551162165 |
oct | 300530131775221 |
9 | 51782548326105 |
10 | 13240334023313 |
11 | 4245215421661 |
12 | 159a0950a9695 |
13 | 75073430ac77 |
14 | 33ab9abc2ca5 |
15 | 17e628ac2c78 |
hex | c0ac167fa91 |
13240334023313 has 2 divisors, whose sum is σ = 13240334023314. Its totient is φ = 13240334023312.
The previous prime is 13240334023291. The next prime is 13240334023349. The reversal of 13240334023313 is 31332043304231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7140930751504 + 6099403271809 = 2672252^2 + 2469697^2 .
It is a cyclic number.
It is not a de Polignac number, because 13240334023313 - 238 = 12965456116369 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13240334023313.
It is not a weakly prime, because it can be changed into another prime (13240334023393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6620167011656 + 6620167011657.
It is an arithmetic number, because the mean of its divisors is an integer number (6620167011657).
Almost surely, 213240334023313 is an apocalyptic number.
It is an amenable number.
13240334023313 is a deficient number, since it is larger than the sum of its proper divisors (1).
13240334023313 is an equidigital number, since it uses as much as digits as its factorization.
13240334023313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 13240334023313 its reverse (31332043304231), we get a palindrome (44572377327544).
The spelling of 13240334023313 in words is "thirteen trillion, two hundred forty billion, three hundred thirty-four million, twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •