Base | Representation |
---|---|
bin | 1010100000111011001110… |
… | …11100010011010011111111 |
3 | 10000212101202012000101211002 |
4 | 11100131213130103103333 |
5 | 11012310410333124001 |
6 | 121101520232320515 |
7 | 4604322265612211 |
oct | 520354734232377 |
9 | 100771665011732 |
10 | 23121544426751 |
11 | 7404879062581 |
12 | 271513a54313b |
13 | cb9476c76984 |
14 | 59d1356465b1 |
15 | 2a169ee5346b |
hex | 1507677134ff |
23121544426751 has 2 divisors, whose sum is σ = 23121544426752. Its totient is φ = 23121544426750.
The previous prime is 23121544426703. The next prime is 23121544426753. The reversal of 23121544426751 is 15762444512132.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23121544426751 - 222 = 23121540232447 is a prime.
It is a Sophie Germain prime.
Together with 23121544426753, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 23121544426696 and 23121544426705.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23121544426753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11560772213375 + 11560772213376.
It is an arithmetic number, because the mean of its divisors is an integer number (11560772213376).
Almost surely, 223121544426751 is an apocalyptic number.
23121544426751 is a deficient number, since it is larger than the sum of its proper divisors (1).
23121544426751 is an equidigital number, since it uses as much as digits as its factorization.
23121544426751 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1612800, while the sum is 47.
Adding to 23121544426751 its reverse (15762444512132), we get a palindrome (38883988938883).
The spelling of 23121544426751 in words is "twenty-three trillion, one hundred twenty-one billion, five hundred forty-four million, four hundred twenty-six thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •