Base | Representation |
---|---|
bin | 11110000101100010110010… |
… | …000101101111010100000010 |
3 | 122100111220002102000012110111 |
4 | 132011202302011233110002 |
5 | 114320432123104213010 |
6 | 1145232013254221534 |
7 | 36604654642453204 |
oct | 3605426205572402 |
9 | 570456072005414 |
10 | 132322340304130 |
11 | 39186653513479 |
12 | 12a10b580548aa |
13 | 58aac3513a012 |
14 | 2496614bd6774 |
15 | 104701b18458a |
hex | 7858b216f502 |
132322340304130 has 8 divisors (see below), whose sum is σ = 238180212547452. Its totient is φ = 52928936121648.
The previous prime is 132322340304113. The next prime is 132322340304163. The reversal of 132322340304130 is 31403043223231.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 132037174692049 + 285165612081 = 11490743^2 + 534009^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 132322340304092 and 132322340304101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6616117015197 + ... + 6616117015216.
Almost surely, 2132322340304130 is an apocalyptic number.
132322340304130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132322340304130 is a deficient number, since it is larger than the sum of its proper divisors (105857872243322).
132322340304130 is a wasteful number, since it uses less digits than its factorization.
132322340304130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13232234030420.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 132322340304130 its reverse (31403043223231), we get a palindrome (163725383527361).
The spelling of 132322340304130 in words is "one hundred thirty-two trillion, three hundred twenty-two billion, three hundred forty million, three hundred four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •