Base | Representation |
---|---|
bin | 10101101100111110… |
… | …110011001000011001 |
3 | 2020011001011011011011 |
4 | 111230332303020121 |
5 | 340211112110134 |
6 | 14412205133521 |
7 | 1453322153611 |
oct | 255476631031 |
9 | 66131134134 |
10 | 23303238169 |
11 | 9979085822 |
12 | 462425a2a1 |
13 | 2274b51b33 |
14 | 11b0ca5a41 |
15 | 915c5d264 |
hex | 56cfb3219 |
23303238169 has 2 divisors, whose sum is σ = 23303238170. Its totient is φ = 23303238168.
The previous prime is 23303238149. The next prime is 23303238209. The reversal of 23303238169 is 96183230332.
It is a happy number.
It is an a-pointer prime, because the next prime (23303238209) can be obtained adding 23303238169 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16097265625 + 7205972544 = 126875^2 + 84888^2 .
It is a cyclic number.
It is not a de Polignac number, because 23303238169 - 225 = 23269683737 is a prime.
It is a super-2 number, since 2×233032381692 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23303238149) 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, 11651619084 + 11651619085.
It is an arithmetic number, because the mean of its divisors is an integer number (11651619085).
Almost surely, 223303238169 is an apocalyptic number.
It is an amenable number.
23303238169 is a deficient number, since it is larger than the sum of its proper divisors (1).
23303238169 is an equidigital number, since it uses as much as digits as its factorization.
23303238169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 40.
The spelling of 23303238169 in words is "twenty-three billion, three hundred three million, two hundred thirty-eight thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •