Base | Representation |
---|---|
bin | 111101111100101000… |
… | …1000100101001001101 |
3 | 110201101011100001221210 |
4 | 1323321101010221031 |
5 | 4134421420134013 |
6 | 141040312245033 |
7 | 12416430010443 |
oct | 1737121045115 |
9 | 421334301853 |
10 | 133031021133 |
11 | 514665a817a |
12 | 219479a0779 |
13 | c710b2aa6a |
14 | 661dc68b93 |
15 | 36d8ed3cc3 |
hex | 1ef9444a4d |
133031021133 has 4 divisors (see below), whose sum is σ = 177374694848. Its totient is φ = 88687347420.
The previous prime is 133031021131. The next prime is 133031021191. The reversal of 133031021133 is 331120130331.
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.
It is not a de Polignac number, because 133031021133 - 21 = 133031021131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133031021131) 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 3 ways as a sum of consecutive naturals, for example, 22171836853 + ... + 22171836858.
It is an arithmetic number, because the mean of its divisors is an integer number (44343673712).
Almost surely, 2133031021133 is an apocalyptic number.
It is an amenable number.
133031021133 is a deficient number, since it is larger than the sum of its proper divisors (44343673715).
133031021133 is an equidigital number, since it uses as much as digits as its factorization.
133031021133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44343673714.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 133031021133 its reverse (331120130331), we get a palindrome (464151151464).
The spelling of 133031021133 in words is "one hundred thirty-three billion, thirty-one million, twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •