Base | Representation |
---|---|
bin | 111101100010000101… |
… | …1000001010110011010 |
3 | 110122002002011211011021 |
4 | 1323010023001112122 |
5 | 4131110400223310 |
6 | 140412051553054 |
7 | 12355362345625 |
oct | 1730413012632 |
9 | 418062154137 |
10 | 132140242330 |
11 | 510497a3948 |
12 | 217395bb78a |
13 | c5cb412605 |
14 | 657782cdbc |
15 | 3685bc95da |
hex | 1ec42c159a |
132140242330 has 8 divisors (see below), whose sum is σ = 237852436212. Its totient is φ = 52856096928.
The previous prime is 132140242301. The next prime is 132140242387. The reversal of 132140242330 is 33242041231.
It can be written as a sum of positive squares in 2 ways, for example, as 130853657169 + 1286585161 = 361737^2 + 35869^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1321402423302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132140242295 and 132140242304.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6607012107 + ... + 6607012126.
Almost surely, 2132140242330 is an apocalyptic number.
132140242330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132140242330 is a deficient number, since it is larger than the sum of its proper divisors (105712193882).
132140242330 is a wasteful number, since it uses less digits than its factorization.
132140242330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13214024240.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 132140242330 its reverse (33242041231), we get a palindrome (165382283561).
The spelling of 132140242330 in words is "one hundred thirty-two billion, one hundred forty million, two hundred forty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •