Base | Representation |
---|---|
bin | 100100110101100… |
… | …1110011100100101 |
3 | 10012010212202201020 |
4 | 1021223032130211 |
5 | 10012413140013 |
6 | 322353121353 |
7 | 42426256116 |
oct | 11153163445 |
9 | 3163782636 |
10 | 1236068133 |
11 | 584801313 |
12 | 2a5b59259 |
13 | 169112481 |
14 | ba23c20d |
15 | 737b2623 |
hex | 49ace725 |
1236068133 has 4 divisors (see below), whose sum is σ = 1648090848. Its totient is φ = 824045420.
The previous prime is 1236068089. The next prime is 1236068179. The reversal of 1236068133 is 3318606321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3318606321 = 3 ⋅1106202107.
It is a cyclic number.
It is not a de Polignac number, because 1236068133 - 26 = 1236068069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1236068094 and 1236068103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1236068633) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 206011353 + ... + 206011358.
It is an arithmetic number, because the mean of its divisors is an integer number (412022712).
Almost surely, 21236068133 is an apocalyptic number.
It is an amenable number.
1236068133 is a deficient number, since it is larger than the sum of its proper divisors (412022715).
1236068133 is an equidigital number, since it uses as much as digits as its factorization.
1236068133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 412022714.
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 1236068133 is about 35157.7606368779. The cubic root of 1236068133 is about 1073.2003443522.
The spelling of 1236068133 in words is "one billion, two hundred thirty-six million, sixty-eight thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •