Base | Representation |
---|---|
bin | 1011111011101100010101… |
… | …1011100000001101100001 |
3 | 1201110021101021201000022222 |
4 | 2332323011123200031201 |
5 | 3204430022431141421 |
6 | 43523151002040425 |
7 | 2522620234461512 |
oct | 276730533401541 |
9 | 51407337630288 |
10 | 13120142443361 |
11 | 41a92484056a8 |
12 | 157a9311a9115 |
13 | 7422bb526ca5 |
14 | 33503824aa09 |
15 | 17b441dc7cab |
hex | beec56e0361 |
13120142443361 has 2 divisors, whose sum is σ = 13120142443362. Its totient is φ = 13120142443360.
The previous prime is 13120142443337. The next prime is 13120142443483. The reversal of 13120142443361 is 16334424102131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10357815342736 + 2762327100625 = 3218356^2 + 1662025^2 .
It is a cyclic number.
It is not a de Polignac number, because 13120142443361 - 218 = 13120142181217 is a prime.
It is not a weakly prime, because it can be changed into another prime (13120141443361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560071221680 + 6560071221681.
It is an arithmetic number, because the mean of its divisors is an integer number (6560071221681).
Almost surely, 213120142443361 is an apocalyptic number.
It is an amenable number.
13120142443361 is a deficient number, since it is larger than the sum of its proper divisors (1).
13120142443361 is an equidigital number, since it uses as much as digits as its factorization.
13120142443361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 13120142443361 its reverse (16334424102131), we get a palindrome (29454566545492).
The spelling of 13120142443361 in words is "thirteen trillion, one hundred twenty billion, one hundred forty-two million, four hundred forty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •