Base | Representation |
---|---|
bin | 10110000101001011… |
… | …011100010111000101 |
3 | 2021012100001110021011 |
4 | 112011023130113011 |
5 | 342024024042312 |
6 | 14520350322221 |
7 | 1466351632303 |
oct | 260513342705 |
9 | 67170043234 |
10 | 23709205957 |
11 | a067257398 |
12 | 47181b9371 |
13 | 230aca2868 |
14 | 120cb81273 |
15 | 93b6eeda7 |
hex | 5852dc5c5 |
23709205957 has 2 divisors, whose sum is σ = 23709205958. Its totient is φ = 23709205956.
The previous prime is 23709205829. The next prime is 23709205967. The reversal of 23709205957 is 75950290732.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17402622561 + 6306583396 = 131919^2 + 79414^2 .
It is a cyclic number.
It is not a de Polignac number, because 23709205957 - 27 = 23709205829 is a prime.
It is a super-2 number, since 2×237092059572 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23709205957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23709205967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11854602978 + 11854602979.
It is an arithmetic number, because the mean of its divisors is an integer number (11854602979).
Almost surely, 223709205957 is an apocalyptic number.
It is an amenable number.
23709205957 is a deficient number, since it is larger than the sum of its proper divisors (1).
23709205957 is an equidigital number, since it uses as much as digits as its factorization.
23709205957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1190700, while the sum is 49.
The spelling of 23709205957 in words is "twenty-three billion, seven hundred nine million, two hundred five thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •