Base | Representation |
---|---|
bin | 1100001000100011110101… |
… | …1111111110100100011101 |
3 | 1202020101222011220022000121 |
4 | 3002020331133332210131 |
5 | 3222040234223324201 |
6 | 44212510205154541 |
7 | 2544604243514641 |
oct | 302107537764435 |
9 | 52211864808017 |
10 | 13341200214301 |
11 | 4283a75797883 |
12 | 15b5744b5ba51 |
13 | 75a0ba40744b |
14 | 341a08cbcc21 |
15 | 18207ddab9a1 |
hex | c223d7fe91d |
13341200214301 has 2 divisors, whose sum is σ = 13341200214302. Its totient is φ = 13341200214300.
The previous prime is 13341200214253. The next prime is 13341200214401. The reversal of 13341200214301 is 10341200214331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9573758034201 + 3767442180100 = 3094149^2 + 1940990^2 .
It is a cyclic number.
It is not a de Polignac number, because 13341200214301 - 211 = 13341200212253 is a prime.
It is a super-3 number, since 3×133412002143013 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13341200214401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6670600107150 + 6670600107151.
It is an arithmetic number, because the mean of its divisors is an integer number (6670600107151).
Almost surely, 213341200214301 is an apocalyptic number.
It is an amenable number.
13341200214301 is a deficient number, since it is larger than the sum of its proper divisors (1).
13341200214301 is an equidigital number, since it uses as much as digits as its factorization.
13341200214301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13341200214301 its reverse (10341200214331), we get a palindrome (23682400428632).
The spelling of 13341200214301 in words is "thirteen trillion, three hundred forty-one billion, two hundred million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •