Base | Representation |
---|---|
bin | 1010101010010000001010… |
… | …11010110101111111001001 |
3 | 10002000000221211220111111001 |
4 | 11111020011122311333021 |
5 | 11033033230220041041 |
6 | 121505041052135001 |
7 | 4636426111630141 |
oct | 525100532657711 |
9 | 102000854814431 |
10 | 23442022424521 |
11 | 7518784587678 |
12 | 2767279a67461 |
13 | 101075b50070c |
14 | 5b0858339921 |
15 | 2a9baa2ec131 |
hex | 1552056b5fc9 |
23442022424521 has 2 divisors, whose sum is σ = 23442022424522. Its totient is φ = 23442022424520.
The previous prime is 23442022424489. The next prime is 23442022424567. The reversal of 23442022424521 is 12542422024432.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22730353028496 + 711669396025 = 4767636^2 + 843605^2 .
It is a cyclic number.
It is not a de Polignac number, because 23442022424521 - 25 = 23442022424489 is a prime.
It is not a weakly prime, because it can be changed into another prime (23442022424321) 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, 11721011212260 + 11721011212261.
It is an arithmetic number, because the mean of its divisors is an integer number (11721011212261).
Almost surely, 223442022424521 is an apocalyptic number.
It is an amenable number.
23442022424521 is a deficient number, since it is larger than the sum of its proper divisors (1).
23442022424521 is an equidigital number, since it uses as much as digits as its factorization.
23442022424521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 245760, while the sum is 37.
Adding to 23442022424521 its reverse (12542422024432), we get a palindrome (35984444448953).
The spelling of 23442022424521 in words is "twenty-three trillion, four hundred forty-two billion, twenty-two million, four hundred twenty-four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •