Base | Representation |
---|---|
bin | 111001011110010011… |
… | …0001111000101000011 |
3 | 102210120120120102012101 |
4 | 1302330212033011003 |
5 | 4010232321133011 |
6 | 132411100011231 |
7 | 11626354044454 |
oct | 1627446170503 |
9 | 383516512171 |
10 | 123423224131 |
11 | 48386213079 |
12 | 1bb06230b17 |
13 | b83c481c8c |
14 | 5d8bc3b12b |
15 | 33257992c1 |
hex | 1cbc98f143 |
123423224131 has 2 divisors, whose sum is σ = 123423224132. Its totient is φ = 123423224130.
The previous prime is 123423224129. The next prime is 123423224149. The reversal of 123423224131 is 131422324321.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 123423224131 - 21 = 123423224129 is a prime.
It is a super-2 number, since 2×1234232241312 (a number of 23 digits) contains 22 as substring.
Together with 123423224129, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 123423224131.
It is not a weakly prime, because it can be changed into another prime (123423224231) 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, 61711612065 + 61711612066.
It is an arithmetic number, because the mean of its divisors is an integer number (61711612066).
Almost surely, 2123423224131 is an apocalyptic number.
123423224131 is a deficient number, since it is larger than the sum of its proper divisors (1).
123423224131 is an equidigital number, since it uses as much as digits as its factorization.
123423224131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 28.
Adding to 123423224131 its reverse (131422324321), we get a palindrome (254845548452).
The spelling of 123423224131 in words is "one hundred twenty-three billion, four hundred twenty-three million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •