Base | Representation |
---|---|
bin | 1010110110101001101100… |
… | …01101110011101010111001 |
3 | 10010111202120221111121001222 |
4 | 11123110312031303222321 |
5 | 11112023222432244144 |
6 | 122432454424321425 |
7 | 5012260231545623 |
oct | 533246615635271 |
9 | 103452527447058 |
10 | 23868042853049 |
11 | 767241aa5205a |
12 | 2815953313275 |
13 | 10419928b5915 |
14 | 5c73101cdc13 |
15 | 2b5ce12822ee |
hex | 15b536373ab9 |
23868042853049 has 2 divisors, whose sum is σ = 23868042853050. Its totient is φ = 23868042853048.
The previous prime is 23868042853009. The next prime is 23868042853051. The reversal of 23868042853049 is 94035824086832.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23868041853049 + 1000000 = 4885493^2 + 1000^2 .
It is a cyclic number.
It is not a de Polignac number, because 23868042853049 - 212 = 23868042848953 is a prime.
Together with 23868042853051, 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 = 23868042852982 and 23868042853000.
It is not a weakly prime, because it can be changed into another prime (23868042853009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11934021426524 + 11934021426525.
It is an arithmetic number, because the mean of its divisors is an integer number (11934021426525).
Almost surely, 223868042853049 is an apocalyptic number.
It is an amenable number.
23868042853049 is a deficient number, since it is larger than the sum of its proper divisors (1).
23868042853049 is an equidigital number, since it uses as much as digits as its factorization.
23868042853049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 79626240, while the sum is 62.
The spelling of 23868042853049 in words is "twenty-three trillion, eight hundred sixty-eight billion, forty-two million, eight hundred fifty-three thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •