Base | Representation |
---|---|
bin | 111001010101101001… |
… | …1100010110000001111 |
3 | 102202211100200011020010 |
4 | 1302223103202300033 |
5 | 4004134034030221 |
6 | 132322213524303 |
7 | 11616232114500 |
oct | 1625323426017 |
9 | 382740604203 |
10 | 123133111311 |
11 | 48247482011 |
12 | 1ba45043693 |
13 | b7c43365a2 |
14 | 5d614bcba7 |
15 | 330a08ec76 |
hex | 1cab4e2c0f |
123133111311 has 72 divisors (see below), whose sum is σ = 201830848560. Its totient is φ = 66569900544.
The previous prime is 123133111301. The next prime is 123133111313. The reversal of 123133111311 is 113111331321.
It is not a de Polignac number, because 123133111311 - 219 = 123132587023 is a prime.
It is a super-2 number, since 2×1231331113112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123133111313) 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 71 ways as a sum of consecutive naturals, for example, 68827005 + ... + 68828793.
It is an arithmetic number, because the mean of its divisors is an integer number (2803206230).
Almost surely, 2123133111311 is an apocalyptic number.
123133111311 is a deficient number, since it is larger than the sum of its proper divisors (78697737249).
123133111311 is a wasteful number, since it uses less digits than its factorization.
123133111311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3141 (or 3115 counting only the distinct ones).
The product of its digits is 162, while the sum is 21.
Adding to 123133111311 its reverse (113111331321), we get a palindrome (236244442632).
The spelling of 123133111311 in words is "one hundred twenty-three billion, one hundred thirty-three million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •