Base | Representation |
---|---|
bin | 10101110000111100… |
… | …010000111100010101 |
3 | 2020022200011212221001 |
4 | 111300330100330111 |
5 | 340330114321314 |
6 | 14422541223301 |
7 | 1455060011512 |
oct | 256074207425 |
9 | 66280155831 |
10 | 23369682709 |
11 | 9a0263856a |
12 | 4642561b31 |
13 | 2285847229 |
14 | 11b9a40309 |
15 | 91b9d5674 |
hex | 570f10f15 |
23369682709 has 2 divisors, whose sum is σ = 23369682710. Its totient is φ = 23369682708.
The previous prime is 23369682673. The next prime is 23369682767. The reversal of 23369682709 is 90728696332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20499080625 + 2870602084 = 143175^2 + 53578^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23369682709 is a prime.
It is a super-2 number, since 2×233696827092 (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 23369682709.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23369682779) 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, 11684841354 + 11684841355.
It is an arithmetic number, because the mean of its divisors is an integer number (11684841355).
Almost surely, 223369682709 is an apocalyptic number.
It is an amenable number.
23369682709 is a deficient number, since it is larger than the sum of its proper divisors (1).
23369682709 is an equidigital number, since it uses as much as digits as its factorization.
23369682709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5878656, while the sum is 55.
The spelling of 23369682709 in words is "twenty-three billion, three hundred sixty-nine million, six hundred eighty-two thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •