Base | Representation |
---|---|
bin | 1100000110001110001101… |
… | …0110010101011010010101 |
3 | 1202002120021212020222120202 |
4 | 3001203203112111122111 |
5 | 3220411003424000232 |
6 | 44142224335110245 |
7 | 2541652666220123 |
oct | 301434326253225 |
9 | 52076255228522 |
10 | 13301033031317 |
11 | 4268a33430789 |
12 | 15a99b5072385 |
13 | 75638881ab55 |
14 | 33dab8432913 |
15 | 180ecc89e162 |
hex | c18e3595695 |
13301033031317 has 2 divisors, whose sum is σ = 13301033031318. Its totient is φ = 13301033031316.
The previous prime is 13301033031301. The next prime is 13301033031343. The reversal of 13301033031317 is 71313033010331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13147593173521 + 153439857796 = 3625961^2 + 391714^2 .
It is a cyclic number.
It is not a de Polignac number, because 13301033031317 - 24 = 13301033031301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13301033031317.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13301033030317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650516515658 + 6650516515659.
It is an arithmetic number, because the mean of its divisors is an integer number (6650516515659).
Almost surely, 213301033031317 is an apocalyptic number.
It is an amenable number.
13301033031317 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301033031317 is an equidigital number, since it uses as much as digits as its factorization.
13301033031317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103, while the sum is 29.
Adding to 13301033031317 its reverse (71313033010331), we get a palindrome (84614066041648).
The spelling of 13301033031317 in words is "thirteen trillion, three hundred one billion, thirty-three million, thirty-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •