Base | Representation |
---|---|
bin | 10000010110001011001… |
… | …110001101101000011101 |
3 | 10222101111020221110100201 |
4 | 100112023032031220131 |
5 | 121401030442120013 |
6 | 2220014101423501 |
7 | 144104654232115 |
oct | 20261316155035 |
9 | 3871436843321 |
10 | 1123322223133 |
11 | 3a3442123470 |
12 | 16185a40ab91 |
13 | 81c0c8464c6 |
14 | 3c524ab2045 |
15 | 1e34820e3dd |
hex | 1058b38da1d |
1123322223133 has 8 divisors (see below), whose sum is σ = 1253941086816. Its totient is φ = 997453136400.
The previous prime is 1123322223097. The next prime is 1123322223139. The reversal of 1123322223133 is 3313222233211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123322223133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123322223139) 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 7 ways as a sum of consecutive naturals, for example, 1187443738 + ... + 1187444683.
It is an arithmetic number, because the mean of its divisors is an integer number (156742635852).
Almost surely, 21123322223133 is an apocalyptic number.
It is an amenable number.
1123322223133 is a deficient number, since it is larger than the sum of its proper divisors (130618863683).
1123322223133 is a wasteful number, since it uses less digits than its factorization.
1123322223133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2374888475.
The product of its digits is 7776, while the sum is 28.
Adding to 1123322223133 its reverse (3313222233211), we get a palindrome (4436544456344).
The spelling of 1123322223133 in words is "one trillion, one hundred twenty-three billion, three hundred twenty-two million, two hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •