Base | Representation |
---|---|
bin | 1100001000100011110101… |
… | …1111111110100110000001 |
3 | 1202020101222011220022011022 |
4 | 3002020331133332212001 |
5 | 3222040234223330101 |
6 | 44212510205155225 |
7 | 2544604243515143 |
oct | 302107537764601 |
9 | 52211864808138 |
10 | 13341200214401 |
11 | 4283a75797964 |
12 | 15b5744b5bb15 |
13 | 75a0ba4074c7 |
14 | 341a08cbcc93 |
15 | 18207ddaba1b |
hex | c223d7fe981 |
13341200214401 has 2 divisors, whose sum is σ = 13341200214402. Its totient is φ = 13341200214400.
The previous prime is 13341200214301. The next prime is 13341200214473. The reversal of 13341200214401 is 10441200214331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8760534432400 + 4580665782001 = 2959820^2 + 2140249^2 .
It is a cyclic number.
It is not a de Polignac number, because 13341200214401 - 226 = 13341133105537 is a prime.
It is not a weakly prime, because it can be changed into another prime (13341200214491) 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, 6670600107200 + 6670600107201.
It is an arithmetic number, because the mean of its divisors is an integer number (6670600107201).
Almost surely, 213341200214401 is an apocalyptic number.
It is an amenable number.
13341200214401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13341200214401 is an equidigital number, since it uses as much as digits as its factorization.
13341200214401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 13341200214401 its reverse (10441200214331), we get a palindrome (23782400428732).
The spelling of 13341200214401 in words is "thirteen trillion, three hundred forty-one billion, two hundred million, two hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •