Base | Representation |
---|---|
bin | 111001010011010001… |
… | …1101000010000111001 |
3 | 102202121210202112121210 |
4 | 1302212203220100321 |
5 | 4004003140121410 |
6 | 132310250153333 |
7 | 11614243666656 |
oct | 1624643502071 |
9 | 382553675553 |
10 | 123053442105 |
11 | 482065073a0 |
12 | 1ba22422849 |
13 | b7b0990949 |
14 | 5d54aa0c2d |
15 | 33030a4220 |
hex | 1ca68e8439 |
123053442105 has 32 divisors (see below), whose sum is σ = 217197521280. Its totient is φ = 58991905280.
The previous prime is 123053442103. The next prime is 123053442119. The reversal of 123053442105 is 501244350321.
It is not a de Polignac number, because 123053442105 - 21 = 123053442103 is a prime.
It is a super-2 number, since 2×1230534421052 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (123053442103) 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 in 31 ways as a sum of consecutive naturals, for example, 4175082 + ... + 4204451.
It is an arithmetic number, because the mean of its divisors is an integer number (6787422540).
Almost surely, 2123053442105 is an apocalyptic number.
123053442105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
123053442105 is a deficient number, since it is larger than the sum of its proper divisors (94144079175).
123053442105 is a wasteful number, since it uses less digits than its factorization.
123053442105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8379641.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 123053442105 its reverse (501244350321), we get a palindrome (624297792426).
The spelling of 123053442105 in words is "one hundred twenty-three billion, fifty-three million, four hundred forty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •