Base | Representation |
---|---|
bin | 111101111100101000… |
… | …1110101101011100101 |
3 | 110201101011201021110220 |
4 | 1323321101311223211 |
5 | 4134421443100424 |
6 | 141040320434553 |
7 | 12416431505151 |
oct | 1737121655345 |
9 | 421334637426 |
10 | 133031221989 |
11 | 51466725076 |
12 | 21947a78a59 |
13 | c710b9b303 |
14 | 661dcbc061 |
15 | 36d9023579 |
hex | 1ef9475ae5 |
133031221989 has 8 divisors (see below), whose sum is σ = 178651042080. Its totient is φ = 88049441616.
The previous prime is 133031221969. The next prime is 133031222047. The reversal of 133031221989 is 989122130331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133031221989 - 232 = 128736254693 is a prime.
It is a super-2 number, since 2×1330312219892 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133031221989.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133031221969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159509442 + ... + 159510275.
It is an arithmetic number, because the mean of its divisors is an integer number (22331380260).
Almost surely, 2133031221989 is an apocalyptic number.
It is an amenable number.
133031221989 is a deficient number, since it is larger than the sum of its proper divisors (45619820091).
133031221989 is a wasteful number, since it uses less digits than its factorization.
133031221989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319019859.
The product of its (nonzero) digits is 69984, while the sum is 42.
The spelling of 133031221989 in words is "one hundred thirty-three billion, thirty-one million, two hundred twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •