Base | Representation |
---|---|
bin | 11100000011110000011001… |
… | …110010111110010010100011 |
3 | 121011221020211102200100000222 |
4 | 130003300121302332102203 |
5 | 112133320212341011121 |
6 | 1114242430552433255 |
7 | 34664414053441013 |
oct | 3403603162762243 |
9 | 534836742610028 |
10 | 123403433141411 |
11 | 36358113984235 |
12 | 11a104b40a882b |
13 | 53b1b80925817 |
14 | 2268a88081c43 |
15 | e40016d950ab |
hex | 703c19cbe4a3 |
123403433141411 has 2 divisors, whose sum is σ = 123403433141412. Its totient is φ = 123403433141410.
The previous prime is 123403433141393. The next prime is 123403433141423. The reversal of 123403433141411 is 114141334304321.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123403433141411 - 230 = 123402359399587 is a prime.
It is a super-2 number, since 2×1234034331414112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (123403433441411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61701716570705 + 61701716570706.
It is an arithmetic number, because the mean of its divisors is an integer number (61701716570706).
Almost surely, 2123403433141411 is an apocalyptic number.
123403433141411 is a deficient number, since it is larger than the sum of its proper divisors (1).
123403433141411 is an equidigital number, since it uses as much as digits as its factorization.
123403433141411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 123403433141411 its reverse (114141334304321), we get a palindrome (237544767445732).
The spelling of 123403433141411 in words is "one hundred twenty-three trillion, four hundred three billion, four hundred thirty-three million, one hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •