Base | Representation |
---|---|
bin | 1001111110000010111110… |
… | …01101110011111011110101 |
3 | 2212121211101021012211100012 |
4 | 10333001133031303323311 |
5 | 10333142012244104101 |
6 | 114343200555030005 |
7 | 4421615054611142 |
oct | 477013715637365 |
9 | 85554337184305 |
10 | 21923110534901 |
11 | 6a925a23a9744 |
12 | 2560a1943b305 |
13 | c30456c894a4 |
14 | 55b12710d3c9 |
15 | 28040c9bebbb |
hex | 13f05f373ef5 |
21923110534901 has 2 divisors, whose sum is σ = 21923110534902. Its totient is φ = 21923110534900.
The previous prime is 21923110534873. The next prime is 21923110534903. The reversal of 21923110534901 is 10943501132912.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21538871718001 + 384238816900 = 4640999^2 + 619870^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21923110534901 is a prime.
Together with 21923110534903, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21923110534903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10961555267450 + 10961555267451.
It is an arithmetic number, because the mean of its divisors is an integer number (10961555267451).
Almost surely, 221923110534901 is an apocalyptic number.
It is an amenable number.
21923110534901 is a deficient number, since it is larger than the sum of its proper divisors (1).
21923110534901 is an equidigital number, since it uses as much as digits as its factorization.
21923110534901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 41.
The spelling of 21923110534901 in words is "twenty-one trillion, nine hundred twenty-three billion, one hundred ten million, five hundred thirty-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •