Base | Representation |
---|---|
bin | 10101110101010000… |
… | …100001001111101111 |
3 | 2020111201110010110112 |
4 | 111311100201033233 |
5 | 341002134214411 |
6 | 14434045330235 |
7 | 1456626400313 |
oct | 256520411757 |
9 | 66451403415 |
10 | 23442101231 |
11 | 9a3a50068a |
12 | 466286697b |
13 | 2297851823 |
14 | 11c54d1b43 |
15 | 92303cb8b |
hex | 5754213ef |
23442101231 has 2 divisors, whose sum is σ = 23442101232. Its totient is φ = 23442101230.
The previous prime is 23442101209. The next prime is 23442101233. The reversal of 23442101231 is 13210124432.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23442101231 - 26 = 23442101167 is a prime.
It is a super-2 number, since 2×234421012312 (a number of 22 digits) contains 22 as substring.
Together with 23442101233, 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 = 23442101197 and 23442101206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23442101233) 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, 11721050615 + 11721050616.
It is an arithmetic number, because the mean of its divisors is an integer number (11721050616).
Almost surely, 223442101231 is an apocalyptic number.
23442101231 is a deficient number, since it is larger than the sum of its proper divisors (1).
23442101231 is an equidigital number, since it uses as much as digits as its factorization.
23442101231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 23442101231 its reverse (13210124432), we get a palindrome (36652225663).
The spelling of 23442101231 in words is "twenty-three billion, four hundred forty-two million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •