Base | Representation |
---|---|
bin | 111101110111100100… |
… | …0011101010100011111 |
3 | 110200221022101122010020 |
4 | 1323233020131110133 |
5 | 4134044403201001 |
6 | 141011400043223 |
7 | 12412263534156 |
oct | 1735710352437 |
9 | 420838348106 |
10 | 132860990751 |
11 | 513896248a5 |
12 | 218baa63513 |
13 | c6b4837978 |
14 | 660544859d |
15 | 36c90e9736 |
hex | 1eef21d51f |
132860990751 has 8 divisors (see below), whose sum is σ = 177192658944. Its totient is φ = 88551658200.
The previous prime is 132860990711. The next prime is 132860990767. The reversal of 132860990751 is 157099068231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132860990751 - 213 = 132860982559 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132860990694 and 132860990703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132860990711) 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, 5570025 + ... + 5593826.
It is an arithmetic number, because the mean of its divisors is an integer number (22149082368).
Almost surely, 2132860990751 is an apocalyptic number.
132860990751 is a deficient number, since it is larger than the sum of its proper divisors (44331668193).
132860990751 is a wasteful number, since it uses less digits than its factorization.
132860990751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11167821.
The product of its (nonzero) digits is 816480, while the sum is 51.
The spelling of 132860990751 in words is "one hundred thirty-two billion, eight hundred sixty million, nine hundred ninety thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •