Base | Representation |
---|---|
bin | 111101101100110011… |
… | …1011110101001111011 |
3 | 110200000011011121201202 |
4 | 1323121213132221323 |
5 | 4132330001231211 |
6 | 140511503204415 |
7 | 12400321422602 |
oct | 1733147365173 |
9 | 420004147652 |
10 | 132500023931 |
11 | 5121389a110 |
12 | 21819ba670b |
13 | c657b11b32 |
14 | 65ad524a39 |
15 | 36a759653b |
hex | 1ed99dea7b |
132500023931 has 8 divisors (see below), whose sum is σ = 144670859184. Its totient is φ = 120350085120.
The previous prime is 132500023919. The next prime is 132500023963. The reversal of 132500023931 is 139320005231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132500023931 is a prime.
It is a super-2 number, since 2×1325000239312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132500023894 and 132500023903.
It is not an unprimeable number, because it can be changed into a prime (132500023031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5210846 + ... + 5236211.
It is an arithmetic number, because the mean of its divisors is an integer number (18083857398).
Almost surely, 2132500023931 is an apocalyptic number.
132500023931 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132500023931 is a deficient number, since it is larger than the sum of its proper divisors (12170835253).
132500023931 is a wasteful number, since it uses less digits than its factorization.
132500023931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10448221.
The product of its (nonzero) digits is 4860, while the sum is 29.
The spelling of 132500023931 in words is "one hundred thirty-two billion, five hundred million, twenty-three thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •