Base | Representation |
---|---|
bin | 111110011001000000… |
… | …0100000001111111111 |
3 | 110210211111121112202012 |
4 | 1330302000200033333 |
5 | 4143344120312241 |
6 | 141315000121435 |
7 | 12452136350144 |
oct | 1746200401777 |
9 | 423744545665 |
10 | 133982979071 |
11 | 51904998277 |
12 | 21b7276627b |
13 | c833116a96 |
14 | 66b046c3cb |
15 | 37428756eb |
hex | 1f320203ff |
133982979071 has 2 divisors, whose sum is σ = 133982979072. Its totient is φ = 133982979070.
The previous prime is 133982979029. The next prime is 133982979133. The reversal of 133982979071 is 170979289331.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133982979071 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133982979071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133982979671) 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 as a sum of consecutive naturals, namely, 66991489535 + 66991489536.
It is an arithmetic number, because the mean of its divisors is an integer number (66991489536).
Almost surely, 2133982979071 is an apocalyptic number.
133982979071 is a deficient number, since it is larger than the sum of its proper divisors (1).
133982979071 is an equidigital number, since it uses as much as digits as its factorization.
133982979071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5143824, while the sum is 59.
The spelling of 133982979071 in words is "one hundred thirty-three billion, nine hundred eighty-two million, nine hundred seventy-nine thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •