Base | Representation |
---|---|
bin | 110001000000010001100011… |
… | …010101111011011011010101 |
3 | 1001021002210212012002122211011 |
4 | 301000101203111323123111 |
5 | 211222112330123343401 |
6 | 2042213542420212221 |
7 | 63253013653014025 |
oct | 6100214325733325 |
9 | 1037083765078734 |
10 | 215523125606101 |
11 | 62743931801485 |
12 | 202099aa83a071 |
13 | 9334988726101 |
14 | 3b31536b85a85 |
15 | 19db3b76a8451 |
hex | c4046357b6d5 |
215523125606101 has 2 divisors, whose sum is σ = 215523125606102. Its totient is φ = 215523125606100.
The previous prime is 215523125606071. The next prime is 215523125606111. The reversal of 215523125606101 is 101606521325512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 215275624331076 + 247501275025 = 14672274^2 + 497495^2 .
It is a cyclic number.
It is not a de Polignac number, because 215523125606101 - 25 = 215523125606069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (215523125606111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107761562803050 + 107761562803051.
It is an arithmetic number, because the mean of its divisors is an integer number (107761562803051).
Almost surely, 2215523125606101 is an apocalyptic number.
It is an amenable number.
215523125606101 is a deficient number, since it is larger than the sum of its proper divisors (1).
215523125606101 is an equidigital number, since it uses as much as digits as its factorization.
215523125606101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 40.
The spelling of 215523125606101 in words is "two hundred fifteen trillion, five hundred twenty-three billion, one hundred twenty-five million, six hundred six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •