Base | Representation |
---|---|
bin | 1010101101011010001010… |
… | …11101110011110000011001 |
3 | 10002101101212211021100101212 |
4 | 11112231011131303300121 |
5 | 11041322331102013131 |
6 | 122030534224152505 |
7 | 4650315425446406 |
oct | 526550535636031 |
9 | 102341784240355 |
10 | 23550471126041 |
11 | 755a775a9a222 |
12 | 27842a5168735 |
13 | 101aa524b6c12 |
14 | 5b5bc54a52ad |
15 | 2ac906115a2b |
hex | 156b45773c19 |
23550471126041 has 2 divisors, whose sum is σ = 23550471126042. Its totient is φ = 23550471126040.
The previous prime is 23550471125933. The next prime is 23550471126043. The reversal of 23550471126041 is 14062117405532.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23386847640025 + 163623486016 = 4835995^2 + 404504^2 .
It is a cyclic number.
It is not a de Polignac number, because 23550471126041 - 230 = 23549397384217 is a prime.
Together with 23550471126043, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23550471126041.
It is not a weakly prime, because it can be changed into another prime (23550471126043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11775235563020 + 11775235563021.
It is an arithmetic number, because the mean of its divisors is an integer number (11775235563021).
Almost surely, 223550471126041 is an apocalyptic number.
It is an amenable number.
23550471126041 is a deficient number, since it is larger than the sum of its proper divisors (1).
23550471126041 is an equidigital number, since it uses as much as digits as its factorization.
23550471126041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 201600, while the sum is 41.
The spelling of 23550471126041 in words is "twenty-three trillion, five hundred fifty billion, four hundred seventy-one million, one hundred twenty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •