Base | Representation |
---|---|
bin | 111001011011101001… |
… | …0000001111101010111 |
3 | 102210100100202110112102 |
4 | 1302313102001331113 |
5 | 4010042003311211 |
6 | 132354152312315 |
7 | 11624222024546 |
oct | 1626722017527 |
9 | 383310673472 |
10 | 123334041431 |
11 | 4833a93a867 |
12 | 1baa03a269b |
13 | b826b58053 |
14 | 5d8006415d |
15 | 331ca2ea3b |
hex | 1cb7481f57 |
123334041431 has 2 divisors, whose sum is σ = 123334041432. Its totient is φ = 123334041430.
The previous prime is 123334041401. The next prime is 123334041437. The reversal of 123334041431 is 134140433321.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (134140433321) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123334041431 is a prime.
It is a super-2 number, since 2×1233340414312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123334041394 and 123334041403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123334041437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61667020715 + 61667020716.
It is an arithmetic number, because the mean of its divisors is an integer number (61667020716).
Almost surely, 2123334041431 is an apocalyptic number.
123334041431 is a deficient number, since it is larger than the sum of its proper divisors (1).
123334041431 is an equidigital number, since it uses as much as digits as its factorization.
123334041431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 123334041431 its reverse (134140433321), we get a palindrome (257474474752).
The spelling of 123334041431 in words is "one hundred twenty-three billion, three hundred thirty-four million, forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •