Base | Representation |
---|---|
bin | 1010100011010001010100… |
… | …01011100111111001010101 |
3 | 10001011002201201002121020221 |
4 | 11101220222023213321111 |
5 | 11020120420440214221 |
6 | 121202523544354341 |
7 | 4613204121436501 |
oct | 521505213477125 |
9 | 101132651077227 |
10 | 23202121023061 |
11 | 7435a67491a32 |
12 | 27288874759b1 |
13 | cc3c486a1926 |
14 | 5a2dbabd5301 |
15 | 2a3818d6a541 |
hex | 151a2a2e7e55 |
23202121023061 has 2 divisors, whose sum is σ = 23202121023062. Its totient is φ = 23202121023060.
The previous prime is 23202121023023. The next prime is 23202121023073. The reversal of 23202121023061 is 16032012120232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21647673122436 + 1554447900625 = 4652706^2 + 1246775^2 .
It is a cyclic number.
It is not a de Polignac number, because 23202121023061 - 243 = 14406028000853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23202121023091) 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, 11601060511530 + 11601060511531.
It is an arithmetic number, because the mean of its divisors is an integer number (11601060511531).
Almost surely, 223202121023061 is an apocalyptic number.
It is an amenable number.
23202121023061 is a deficient number, since it is larger than the sum of its proper divisors (1).
23202121023061 is an equidigital number, since it uses as much as digits as its factorization.
23202121023061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 23202121023061 its reverse (16032012120232), we get a palindrome (39234133143293).
The spelling of 23202121023061 in words is "twenty-three trillion, two hundred two billion, one hundred twenty-one million, twenty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •