Base | Representation |
---|---|
bin | 1100000101111000100011… |
… | …0100101000100100010101 |
3 | 1202002000021200122211021102 |
4 | 3001132020310220210111 |
5 | 3220312102113431044 |
6 | 44135423414155445 |
7 | 2541355633154222 |
oct | 301361064504425 |
9 | 52060250584242 |
10 | 13295219280149 |
11 | 426651a750454 |
12 | 15a8852052b85 |
13 | 7559702032c1 |
14 | 33d6c6266949 |
15 | 180c8c2a624e |
hex | c1788d28915 |
13295219280149 has 2 divisors, whose sum is σ = 13295219280150. Its totient is φ = 13295219280148.
The previous prime is 13295219280113. The next prime is 13295219280151. The reversal of 13295219280149 is 94108291259231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11831240277649 + 1463979002500 = 3439657^2 + 1209950^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13295219280149 is a prime.
Together with 13295219280151, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13295219280094 and 13295219280103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13295219280179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6647609640074 + 6647609640075.
It is an arithmetic number, because the mean of its divisors is an integer number (6647609640075).
Almost surely, 213295219280149 is an apocalyptic number.
It is an amenable number.
13295219280149 is a deficient number, since it is larger than the sum of its proper divisors (1).
13295219280149 is an equidigital number, since it uses as much as digits as its factorization.
13295219280149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2799360, while the sum is 56.
The spelling of 13295219280149 in words is "thirteen trillion, two hundred ninety-five billion, two hundred nineteen million, two hundred eighty thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •