Base | Representation |
---|---|
bin | 10101100010000101… |
… | …010101011011010011 |
3 | 2012200022010010021001 |
4 | 111202011111123103 |
5 | 334322310332011 |
6 | 14342114242431 |
7 | 1445642114131 |
oct | 254205253323 |
9 | 65608103231 |
10 | 23120402131 |
11 | 9894956362 |
12 | 4592b86417 |
13 | 2245cc7128 |
14 | 11948b0751 |
15 | 904b947c1 |
hex | 5621556d3 |
23120402131 has 2 divisors, whose sum is σ = 23120402132. Its totient is φ = 23120402130.
The previous prime is 23120402093. The next prime is 23120402141. The reversal of 23120402131 is 13120402132.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23120402131 - 223 = 23112013523 is a prime.
It is a super-2 number, since 2×231204021312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23120402099 and 23120402108.
It is not a weakly prime, because it can be changed into another prime (23120402141) 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, 11560201065 + 11560201066.
It is an arithmetic number, because the mean of its divisors is an integer number (11560201066).
Almost surely, 223120402131 is an apocalyptic number.
23120402131 is a deficient number, since it is larger than the sum of its proper divisors (1).
23120402131 is an equidigital number, since it uses as much as digits as its factorization.
23120402131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 23120402131 its reverse (13120402132), we get a palindrome (36240804263).
Subtracting from 23120402131 its reverse (13120402132), we obtain a palindrome (9999999999).
The spelling of 23120402131 in words is "twenty-three billion, one hundred twenty million, four hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •