Base | Representation |
---|---|
bin | 1100010000110001100011… |
… | …1100001001000111001001 |
3 | 1202201220020010002212021002 |
4 | 3010030120330021013021 |
5 | 3231343243103330124 |
6 | 44401405340224345 |
7 | 2561031322415042 |
oct | 304143074110711 |
9 | 52656203085232 |
10 | 13482320761289 |
11 | 432890264a506 |
12 | 1618b69b3b0b5 |
13 | 76a4ba1924a3 |
14 | 3487952778c9 |
15 | 185a8d1720ae |
hex | c4318f091c9 |
13482320761289 has 2 divisors, whose sum is σ = 13482320761290. Its totient is φ = 13482320761288.
The previous prime is 13482320761271. The next prime is 13482320761291. The reversal of 13482320761289 is 98216702328431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7884908928064 + 5597411833225 = 2808008^2 + 2365885^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13482320761289 is a prime.
It is a super-2 number, since 2×134823207612892 (a number of 27 digits) contains 22 as substring.
Together with 13482320761291, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13482320761589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6741160380644 + 6741160380645.
It is an arithmetic number, because the mean of its divisors is an integer number (6741160380645).
Almost surely, 213482320761289 is an apocalyptic number.
It is an amenable number.
13482320761289 is a deficient number, since it is larger than the sum of its proper divisors (1).
13482320761289 is an equidigital number, since it uses as much as digits as its factorization.
13482320761289 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6967296, while the sum is 56.
The spelling of 13482320761289 in words is "thirteen trillion, four hundred eighty-two billion, three hundred twenty million, seven hundred sixty-one thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •