Base | Representation |
---|---|
bin | 1010101010100101011100… |
… | …00110101010110110011111 |
3 | 10002001010102201122101101021 |
4 | 11111102232012222312133 |
5 | 11033230122224421002 |
6 | 121514210202225011 |
7 | 4640312111165026 |
oct | 525225606526637 |
9 | 102033381571337 |
10 | 23453442420127 |
11 | 75226048a8375 |
12 | 27695264b5167 |
13 | 101185b44aa75 |
14 | 5b121ccd78bd |
15 | 2aa127b9e737 |
hex | 1554ae1aad9f |
23453442420127 has 2 divisors, whose sum is σ = 23453442420128. Its totient is φ = 23453442420126.
The previous prime is 23453442420091. The next prime is 23453442420271. The reversal of 23453442420127 is 72102424435432.
Together with next prime (23453442420271) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23453442420127 is a prime.
It is a super-2 number, since 2×234534424201272 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23453442421127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11726721210063 + 11726721210064.
It is an arithmetic number, because the mean of its divisors is an integer number (11726721210064).
Almost surely, 223453442420127 is an apocalyptic number.
23453442420127 is a deficient number, since it is larger than the sum of its proper divisors (1).
23453442420127 is an equidigital number, since it uses as much as digits as its factorization.
23453442420127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1290240, while the sum is 43.
Adding to 23453442420127 its reverse (72102424435432), we get a palindrome (95555866855559).
The spelling of 23453442420127 in words is "twenty-three trillion, four hundred fifty-three billion, four hundred forty-two million, four hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •