Base | Representation |
---|---|
bin | 111101110111100100… |
… | …0011101010100101111 |
3 | 110200221022101122010211 |
4 | 1323233020131110233 |
5 | 4134044403201032 |
6 | 141011400043251 |
7 | 12412263534211 |
oct | 1735710352457 |
9 | 420838348124 |
10 | 132860990767 |
11 | 5138962490a |
12 | 218baa63527 |
13 | c6b483798b |
14 | 66054485b1 |
15 | 36c90e9747 |
hex | 1eef21d52f |
132860990767 has 2 divisors, whose sum is σ = 132860990768. Its totient is φ = 132860990766.
The previous prime is 132860990711. The next prime is 132860990797. The reversal of 132860990767 is 767099068231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132860990767 - 211 = 132860988719 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132860990797) 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, 66430495383 + 66430495384.
It is an arithmetic number, because the mean of its divisors is an integer number (66430495384).
Almost surely, 2132860990767 is an apocalyptic number.
132860990767 is a deficient number, since it is larger than the sum of its proper divisors (1).
132860990767 is an equidigital number, since it uses as much as digits as its factorization.
132860990767 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6858432, while the sum is 58.
The spelling of 132860990767 in words is "one hundred thirty-two billion, eight hundred sixty million, nine hundred ninety thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •