Base | Representation |
---|---|
bin | 1010101100001000010100… |
… | …00010100000011110001101 |
3 | 10002020012110002211102002101 |
4 | 11112010022002200132031 |
5 | 11040112330224043321 |
6 | 121554425342155101 |
7 | 4644201406002556 |
oct | 526041202403615 |
9 | 102205402742071 |
10 | 23506524440461 |
11 | 7543074261967 |
12 | 277787b582a91 |
13 | 101686a88bb5a |
14 | 5b3a16aa132d |
15 | 2ab6d2dda791 |
hex | 15610a0a078d |
23506524440461 has 2 divisors, whose sum is σ = 23506524440462. Its totient is φ = 23506524440460.
The previous prime is 23506524440459. The next prime is 23506524440467. The reversal of 23506524440461 is 16404442560532.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19144562702500 + 4361961737961 = 4375450^2 + 2088531^2 .
It is a cyclic number.
It is not a de Polignac number, because 23506524440461 - 21 = 23506524440459 is a prime.
Together with 23506524440459, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23506524440467) 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, 11753262220230 + 11753262220231.
It is an arithmetic number, because the mean of its divisors is an integer number (11753262220231).
Almost surely, 223506524440461 is an apocalyptic number.
It is an amenable number.
23506524440461 is a deficient number, since it is larger than the sum of its proper divisors (1).
23506524440461 is an equidigital number, since it uses as much as digits as its factorization.
23506524440461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2764800, while the sum is 46.
The spelling of 23506524440461 in words is "twenty-three trillion, five hundred six billion, five hundred twenty-four million, four hundred forty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •