Base | Representation |
---|---|
bin | 1100000110001110111010… |
… | …0101000001010010000001 |
3 | 1202002120202222202122112121 |
4 | 3001203232211001102001 |
5 | 3220411400141233101 |
6 | 44142255145124241 |
7 | 2541660444456442 |
oct | 301435645012201 |
9 | 52076688678477 |
10 | 13301221430401 |
11 | 426901a80a803 |
12 | 15a9a48189681 |
13 | 7563b88729b8 |
14 | 33dad54752c9 |
15 | 180ede1b60a1 |
hex | c18ee941481 |
13301221430401 has 2 divisors, whose sum is σ = 13301221430402. Its totient is φ = 13301221430400.
The previous prime is 13301221430389. The next prime is 13301221430423. The reversal of 13301221430401 is 10403412210331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12698852967025 + 602368463376 = 3563545^2 + 776124^2 .
It is a cyclic number.
It is not a de Polignac number, because 13301221430401 - 241 = 11102198174849 is a prime.
It is not a weakly prime, because it can be changed into another prime (13301221430461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650610715200 + 6650610715201.
It is an arithmetic number, because the mean of its divisors is an integer number (6650610715201).
Almost surely, 213301221430401 is an apocalyptic number.
It is an amenable number.
13301221430401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301221430401 is an equidigital number, since it uses as much as digits as its factorization.
13301221430401 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 13301221430401 its reverse (10403412210331), we get a palindrome (23704633640732).
The spelling of 13301221430401 in words is "thirteen trillion, three hundred one billion, two hundred twenty-one million, four hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •