Base | Representation |
---|---|
bin | 111001010101010000… |
… | …1101001011001001111 |
3 | 102202210110001121211200 |
4 | 1302222201221121033 |
5 | 4004122212000221 |
6 | 132321025320543 |
7 | 11616012666414 |
oct | 1625241513117 |
9 | 382713047750 |
10 | 123120031311 |
11 | 482400588a2 |
12 | 1ba40796153 |
13 | b7c1706b44 |
14 | 5d5d87610b |
15 | 3308d59426 |
hex | 1caa86964f |
123120031311 has 48 divisors (see below), whose sum is σ = 192574661760. Its totient is φ = 75517977600.
The previous prime is 123120031301. The next prime is 123120031337. The reversal of 123120031311 is 113130021321.
123120031311 is a `hidden beast` number, since 12 + 312 + 0 + 0 + 31 + 311 = 666.
It is not a de Polignac number, because 123120031311 - 234 = 105940162127 is a prime.
It is a super-2 number, since 2×1231200313112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123120031301) 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 47 ways as a sum of consecutive naturals, for example, 1170361 + ... + 1271213.
It is an arithmetic number, because the mean of its divisors is an integer number (4011972120).
Almost surely, 2123120031311 is an apocalyptic number.
123120031311 is a deficient number, since it is larger than the sum of its proper divisors (69454630449).
123120031311 is a wasteful number, since it uses less digits than its factorization.
123120031311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101056 (or 101053 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 123120031311 its reverse (113130021321), we get a palindrome (236250052632).
The spelling of 123120031311 in words is "one hundred twenty-three billion, one hundred twenty million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •