Base | Representation |
---|---|
bin | 1011111010100010100000… |
… | …0000011000100111111101 |
3 | 1201101101012220222211110121 |
4 | 2332220220000120213331 |
5 | 3204113424242123201 |
6 | 43510112105134541 |
7 | 2521316114653432 |
oct | 276505000304775 |
9 | 51341186884417 |
10 | 13100321442301 |
11 | 41a08a6a25195 |
12 | 1576b1b18a451 |
13 | 74047cc626b2 |
14 | 3340b7a3bb89 |
15 | 17ab81c189a1 |
hex | bea280189fd |
13100321442301 has 2 divisors, whose sum is σ = 13100321442302. Its totient is φ = 13100321442300.
The previous prime is 13100321442287. The next prime is 13100321442319. The reversal of 13100321442301 is 10324412300131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13081430314276 + 18891128025 = 3616826^2 + 137445^2 .
It is a cyclic number.
It is not a de Polignac number, because 13100321442301 - 25 = 13100321442269 is a prime.
It is a super-2 number, since 2×131003214423012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13100321442371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550160721150 + 6550160721151.
It is an arithmetic number, because the mean of its divisors is an integer number (6550160721151).
Almost surely, 213100321442301 is an apocalyptic number.
It is an amenable number.
13100321442301 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100321442301 is an equidigital number, since it uses as much as digits as its factorization.
13100321442301 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 13100321442301 its reverse (10324412300131), we get a palindrome (23424733742432).
The spelling of 13100321442301 in words is "thirteen trillion, one hundred billion, three hundred twenty-one million, four hundred forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •