Base | Representation |
---|---|
bin | 1000010001000111010… |
… | …0111001101010101101 |
3 | 111120121112011001000110 |
4 | 2010101310321222231 |
5 | 4311340422014013 |
6 | 145125444050233 |
7 | 13155465406212 |
oct | 2042164715255 |
9 | 446545131013 |
10 | 142033001133 |
11 | 55265a20a71 |
12 | 2363a693979 |
13 | 10516b2234a |
14 | 6c35637b09 |
15 | 3a644522c3 |
hex | 2111d39aad |
142033001133 has 4 divisors (see below), whose sum is σ = 189377334848. Its totient is φ = 94688667420.
The previous prime is 142033001101. The next prime is 142033001137. The reversal of 142033001133 is 331100330241.
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: 331100330241 = 3 ⋅110366776747.
It is not a de Polignac number, because 142033001133 - 25 = 142033001101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142033001137) 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, 23672166853 + ... + 23672166858.
It is an arithmetic number, because the mean of its divisors is an integer number (47344333712).
Almost surely, 2142033001133 is an apocalyptic number.
It is an amenable number.
142033001133 is a deficient number, since it is larger than the sum of its proper divisors (47344333715).
142033001133 is an equidigital number, since it uses as much as digits as its factorization.
142033001133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47344333714.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 142033001133 its reverse (331100330241), we get a palindrome (473133331374).
The spelling of 142033001133 in words is "one hundred forty-two billion, thirty-three million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •