Base | Representation |
---|---|
bin | 10110001100100100110… |
… | …001010100110010010001 |
3 | 12101211010220001201000122 |
4 | 112030210301110302101 |
5 | 144442334024100144 |
6 | 3124421014000025 |
7 | 215126051424563 |
oct | 26144461246221 |
9 | 5354126051018 |
10 | 1525330300049 |
11 | 538986209766 |
12 | 207752046015 |
13 | b0ab81c932a |
14 | 53b7d833333 |
15 | 29a260637ee |
hex | 16324c54c91 |
1525330300049 has 2 divisors, whose sum is σ = 1525330300050. Its totient is φ = 1525330300048.
The previous prime is 1525330300007. The next prime is 1525330300051. The reversal of 1525330300049 is 9400030335251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1516671067024 + 8659233025 = 1231532^2 + 93055^2 .
It is a cyclic number.
It is not a de Polignac number, because 1525330300049 - 224 = 1525313522833 is a prime.
Together with 1525330300051, 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 = 1525330299991 and 1525330300018.
It is not a weakly prime, because it can be changed into another prime (1525330300649) 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, 762665150024 + 762665150025.
It is an arithmetic number, because the mean of its divisors is an integer number (762665150025).
Almost surely, 21525330300049 is an apocalyptic number.
It is an amenable number.
1525330300049 is a deficient number, since it is larger than the sum of its proper divisors (1).
1525330300049 is an equidigital number, since it uses as much as digits as its factorization.
1525330300049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 35.
The spelling of 1525330300049 in words is "one trillion, five hundred twenty-five billion, three hundred thirty million, three hundred thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •