Base | Representation |
---|---|
bin | 111101111110101110… |
… | …1010010001010110011 |
3 | 110201120001122012010111 |
4 | 1323331131102022303 |
5 | 4140042420043443 |
6 | 141051303242151 |
7 | 12421242435025 |
oct | 1737535221263 |
9 | 421501565114 |
10 | 133101331123 |
11 | 514a2260102 |
12 | 21967449357 |
13 | c7225776c7 |
14 | 662932c015 |
15 | 36e027169d |
hex | 1efd7522b3 |
133101331123 has 16 divisors (see below), whose sum is σ = 140581785600. Its totient is φ = 125668825920.
The previous prime is 133101331091. The next prime is 133101331133. The reversal of 133101331123 is 321133101331.
It is a cyclic number.
It is not a de Polignac number, because 133101331123 - 25 = 133101331091 is a prime.
It is a super-2 number, since 2×1331013311232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133101331094 and 133101331103.
It is not an unprimeable number, because it can be changed into a prime (133101331133) 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 in 15 ways as a sum of consecutive naturals, for example, 13589358 + ... + 13599148.
It is an arithmetic number, because the mean of its divisors is an integer number (8786361600).
Almost surely, 2133101331123 is an apocalyptic number.
133101331123 is a deficient number, since it is larger than the sum of its proper divisors (7480454477).
133101331123 is a wasteful number, since it uses less digits than its factorization.
133101331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12162.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 133101331123 its reverse (321133101331), we get a palindrome (454234432454).
The spelling of 133101331123 in words is "one hundred thirty-three billion, one hundred one million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •