Base | Representation |
---|---|
bin | 111001011011101001… |
… | …0010011001100101001 |
3 | 102210100100220001101121 |
4 | 1302313102103030221 |
5 | 4010042013041131 |
6 | 132354154015241 |
7 | 11624222440450 |
oct | 1626722231451 |
9 | 383310801347 |
10 | 123334112041 |
11 | 4833a988918 |
12 | 1baa0417521 |
13 | b826b8122a |
14 | 5d80081b97 |
15 | 331ca45911 |
hex | 1cb7493329 |
123334112041 has 32 divisors (see below), whose sum is σ = 143270443008. Its totient is φ = 103995740160.
The previous prime is 123334112017. The next prime is 123334112059. The reversal of 123334112041 is 140211433321.
It is a cyclic number.
It is not a de Polignac number, because 123334112041 - 27 = 123334111913 is a prime.
It is a super-2 number, since 2×1233341120412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123334111997 and 123334112015.
It is not an unprimeable number, because it can be changed into a prime (123334110041) 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 in 31 ways as a sum of consecutive naturals, for example, 51538341 + ... + 51540733.
It is an arithmetic number, because the mean of its divisors is an integer number (4477201344).
Almost surely, 2123334112041 is an apocalyptic number.
It is an amenable number.
123334112041 is a deficient number, since it is larger than the sum of its proper divisors (19936330967).
123334112041 is a wasteful number, since it uses less digits than its factorization.
123334112041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3001.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 123334112041 its reverse (140211433321), we get a palindrome (263545545362).
The spelling of 123334112041 in words is "one hundred twenty-three billion, three hundred thirty-four million, one hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •