Base | Representation |
---|---|
bin | 111110000101100100… |
… | …1101111011000111111 |
3 | 110202011001222002121222 |
4 | 1330023021233120333 |
5 | 4141030224321314 |
6 | 141130151543555 |
7 | 12430032361655 |
oct | 1741311573077 |
9 | 422131862558 |
10 | 133331088959 |
11 | 515aaa18612 |
12 | 21a1038abbb |
13 | c75b0506a3 |
14 | 664ba58dd5 |
15 | 3705507c8e |
hex | 1f0b26f63f |
133331088959 has 2 divisors, whose sum is σ = 133331088960. Its totient is φ = 133331088958.
The previous prime is 133331088887. The next prime is 133331088971. The reversal of 133331088959 is 959880133331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133331088959 - 212 = 133331084863 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133331088959.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133331085959) 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 as a sum of consecutive naturals, namely, 66665544479 + 66665544480.
It is an arithmetic number, because the mean of its divisors is an integer number (66665544480).
Almost surely, 2133331088959 is an apocalyptic number.
133331088959 is a deficient number, since it is larger than the sum of its proper divisors (1).
133331088959 is an equidigital number, since it uses as much as digits as its factorization.
133331088959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2099520, while the sum is 53.
The spelling of 133331088959 in words is "one hundred thirty-three billion, three hundred thirty-one million, eighty-eight thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •