Base | Representation |
---|---|
bin | 1010100010000101010100… |
… | …11011110000111110111001 |
3 | 10001000012102102112121110022 |
4 | 11101002222123300332321 |
5 | 11013433342201042043 |
6 | 121132055342500225 |
7 | 4610231114506241 |
oct | 521025233607671 |
9 | 101005372477408 |
10 | 23161323065273 |
11 | 741a731068448 |
12 | 27209a0294675 |
13 | cc0146202bc3 |
14 | 5a102a670b21 |
15 | 2a272c2b1868 |
hex | 1510aa6f0fb9 |
23161323065273 has 2 divisors, whose sum is σ = 23161323065274. Its totient is φ = 23161323065272.
The previous prime is 23161323065239. The next prime is 23161323065281. The reversal of 23161323065273 is 37256032316132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22462547444089 + 698775621184 = 4739467^2 + 835928^2 .
It is a cyclic number.
It is not a de Polignac number, because 23161323065273 - 210 = 23161323064249 is a prime.
It is a super-2 number, since 2×231613230652732 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23161323065213) 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, 11580661532636 + 11580661532637.
It is an arithmetic number, because the mean of its divisors is an integer number (11580661532637).
Almost surely, 223161323065273 is an apocalyptic number.
It is an amenable number.
23161323065273 is a deficient number, since it is larger than the sum of its proper divisors (1).
23161323065273 is an equidigital number, since it uses as much as digits as its factorization.
23161323065273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 816480, while the sum is 44.
The spelling of 23161323065273 in words is "twenty-three trillion, one hundred sixty-one billion, three hundred twenty-three million, sixty-five thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •