Base | Representation |
---|---|
bin | 1010100010001001100111… |
… | …11100110100110001111001 |
3 | 10001000102101012211201021021 |
4 | 11101010303330310301321 |
5 | 11014003103313211134 |
6 | 121133120320542441 |
7 | 4610342231066221 |
oct | 521046374646171 |
9 | 101012335751237 |
10 | 23163630210169 |
11 | 7420705419569 |
12 | 2721324a81a21 |
13 | cc04231aa1b7 |
14 | 5a11a8c3d081 |
15 | 2a2814ae50b4 |
hex | 151133f34c79 |
23163630210169 has 2 divisors, whose sum is σ = 23163630210170. Its totient is φ = 23163630210168.
The previous prime is 23163630210137. The next prime is 23163630210443. The reversal of 23163630210169 is 96101203636132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18511032978025 + 4652597232144 = 4302445^2 + 2156988^2 .
It is a cyclic number.
It is not a de Polignac number, because 23163630210169 - 25 = 23163630210137 is a prime.
It is a super-2 number, since 2×231636302101692 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23163630210769) 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, 11581815105084 + 11581815105085.
It is an arithmetic number, because the mean of its divisors is an integer number (11581815105085).
Almost surely, 223163630210169 is an apocalyptic number.
It is an amenable number.
23163630210169 is a deficient number, since it is larger than the sum of its proper divisors (1).
23163630210169 is an equidigital number, since it uses as much as digits as its factorization.
23163630210169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 43.
The spelling of 23163630210169 in words is "twenty-three trillion, one hundred sixty-three billion, six hundred thirty million, two hundred ten thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •