Base | Representation |
---|---|
bin | 10000010101111111010… |
… | …010110110001010011101 |
3 | 10222100222022101201022011 |
4 | 100111333102312022131 |
5 | 121400123230024013 |
6 | 2215542152351221 |
7 | 144100004300161 |
oct | 20257722661235 |
9 | 3870868351264 |
10 | 1123122111133 |
11 | 3a334a174350 |
12 | 1618033a5511 |
13 | 81baa250239 |
14 | 3c5062a0ca1 |
15 | 1e335881c3d |
hex | 1057f4b629d |
1123122111133 has 8 divisors (see below), whose sum is σ = 1225241473536. Its totient is φ = 1021005640800.
The previous prime is 1123122111119. The next prime is 1123122111149. The reversal of 1123122111133 is 3311112213211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1123122111133 - 25 = 1123122111101 is a prime.
It is a super-2 number, since 2×11231221111332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123122111733) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133060 + ... + 1504642.
It is an arithmetic number, because the mean of its divisors is an integer number (153155184192).
Almost surely, 21123122111133 is an apocalyptic number.
It is an amenable number.
1123122111133 is a deficient number, since it is larger than the sum of its proper divisors (102119362403).
1123122111133 is a wasteful number, since it uses less digits than its factorization.
1123122111133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1446035.
The product of its digits is 216, while the sum is 22.
Adding to 1123122111133 its reverse (3311112213211), we get a palindrome (4434234324344).
The spelling of 1123122111133 in words is "one trillion, one hundred twenty-three billion, one hundred twenty-two million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •