Base | Representation |
---|---|
bin | 1010100000111011000010… |
… | …10110011011000000101001 |
3 | 10000212101111001200212102102 |
4 | 11100131201112123000221 |
5 | 11012310203202101441 |
6 | 121101502141543145 |
7 | 4604316615105425 |
oct | 520354126330051 |
9 | 100771431625372 |
10 | 23121442222121 |
11 | 74048263a5741 |
12 | 2715110274ab5 |
13 | cb945ba40869 |
14 | 59d125c3db85 |
15 | 2a1695eb569b |
hex | 15076159b029 |
23121442222121 has 2 divisors, whose sum is σ = 23121442222122. Its totient is φ = 23121442222120.
The previous prime is 23121442222061. The next prime is 23121442222127. The reversal of 23121442222121 is 12122224412132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15178317316096 + 7943124906025 = 3895936^2 + 2818355^2 .
It is a cyclic number.
It is not a de Polignac number, because 23121442222121 - 218 = 23121441959977 is a prime.
It is not a weakly prime, because it can be changed into another prime (23121442222127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11560721111060 + 11560721111061.
It is an arithmetic number, because the mean of its divisors is an integer number (11560721111061).
Almost surely, 223121442222121 is an apocalyptic number.
It is an amenable number.
23121442222121 is a deficient number, since it is larger than the sum of its proper divisors (1).
23121442222121 is an equidigital number, since it uses as much as digits as its factorization.
23121442222121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6144, while the sum is 29.
Adding to 23121442222121 its reverse (12122224412132), we get a palindrome (35243666634253).
The spelling of 23121442222121 in words is "twenty-three trillion, one hundred twenty-one billion, four hundred forty-two million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •