Base | Representation |
---|---|
bin | 10110001001100000101… |
… | …110001001110000010101 |
3 | 12101111122122220202120121 |
4 | 112021200232021300111 |
5 | 144414120012242401 |
6 | 3123114355431541 |
7 | 214651412114515 |
oct | 26114056116025 |
9 | 5344578822517 |
10 | 1522041134101 |
11 | 5375485a46a4 |
12 | 206b945b55b1 |
13 | b06b293b3a7 |
14 | 5394aa77845 |
15 | 298d2400ca1 |
hex | 16260b89c15 |
1522041134101 has 2 divisors, whose sum is σ = 1522041134102. Its totient is φ = 1522041134100.
The previous prime is 1522041134039. The next prime is 1522041134111. The reversal of 1522041134101 is 1014311402251.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1505531454001 + 16509680100 = 1227001^2 + 128490^2 .
It is a cyclic number.
It is not a de Polignac number, because 1522041134101 - 229 = 1521504263189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1522041134111) 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, 761020567050 + 761020567051.
It is an arithmetic number, because the mean of its divisors is an integer number (761020567051).
Almost surely, 21522041134101 is an apocalyptic number.
It is an amenable number.
1522041134101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1522041134101 is an equidigital number, since it uses as much as digits as its factorization.
1522041134101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 1522041134101 its reverse (1014311402251), we get a palindrome (2536352536352).
The spelling of 1522041134101 in words is "one trillion, five hundred twenty-two billion, forty-one million, one hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •