Base | Representation |
---|---|
bin | 100011110000111… |
… | …0011000010010101 |
3 | 10002122002110022221 |
4 | 1013201303002111 |
5 | 4424202322013 |
6 | 315025022341 |
7 | 41511122053 |
oct | 10741630225 |
9 | 3078073287 |
10 | 1200042133 |
11 | 566435464 |
12 | 295a849b1 |
13 | 16180a704 |
14 | b55411d3 |
15 | 7054808d |
hex | 47873095 |
1200042133 has 2 divisors, whose sum is σ = 1200042134. Its totient is φ = 1200042132.
The previous prime is 1200042131. The next prime is 1200042163. The reversal of 1200042133 is 3312400021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1051250929 + 148791204 = 32423^2 + 12198^2 .
It is a cyclic number.
It is not a de Polignac number, because 1200042133 - 21 = 1200042131 is a prime.
It is a super-2 number, since 2×12000421332 = 2880202241950379378, which contains 22 as substring.
Together with 1200042131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200042131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600021066 + 600021067.
It is an arithmetic number, because the mean of its divisors is an integer number (600021067).
Almost surely, 21200042133 is an apocalyptic number.
It is an amenable number.
1200042133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200042133 is an equidigital number, since it uses as much as digits as its factorization.
1200042133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 1200042133 is about 34641.6242835119. The cubic root of 1200042133 is about 1062.6710059797.
Adding to 1200042133 its reverse (3312400021), we get a palindrome (4512442154).
The spelling of 1200042133 in words is "one billion, two hundred million, forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •