Base | Representation |
---|---|
bin | 1010100110101001110111… |
… | …10100101011101000110111 |
3 | 10001120012211001222020200112 |
4 | 11103110323310223220313 |
5 | 11024022021031202314 |
6 | 121332152201533235 |
7 | 4624461136064606 |
oct | 523247364535067 |
9 | 101505731866615 |
10 | 23318381115959 |
11 | 74802a725a536 |
12 | 27473127a421b |
13 | 1001bb5b01bc7 |
14 | 5a888956da3d |
15 | 2a687082543e |
hex | 15353bd2ba37 |
23318381115959 has 2 divisors, whose sum is σ = 23318381115960. Its totient is φ = 23318381115958.
The previous prime is 23318381115941. The next prime is 23318381115961. The reversal of 23318381115959 is 95951118381332.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23318381115959 - 28 = 23318381115703 is a prime.
It is a super-2 number, since 2×233183811159592 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 23318381115961, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 23318381115898 and 23318381115907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23318381115859) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11659190557979 + 11659190557980.
It is an arithmetic number, because the mean of its divisors is an integer number (11659190557980).
Almost surely, 223318381115959 is an apocalyptic number.
23318381115959 is a deficient number, since it is larger than the sum of its proper divisors (1).
23318381115959 is an equidigital number, since it uses as much as digits as its factorization.
23318381115959 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6998400, while the sum is 59.
The spelling of 23318381115959 in words is "twenty-three trillion, three hundred eighteen billion, three hundred eighty-one million, one hundred fifteen thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •