Base | Representation |
---|---|
bin | 11110000101010000001000… |
… | …110110101001101100111101 |
3 | 122100102222102020101210122221 |
4 | 132011100020312221230331 |
5 | 114320120123202132201 |
6 | 1145214503002005341 |
7 | 36603345565341010 |
oct | 3605201066515475 |
9 | 570388366353587 |
10 | 132302321130301 |
11 | 39179110188913 |
12 | 12a090ab7a6851 |
13 | 58a90947ab02a |
14 | 249567615d377 |
15 | 10467488cc4a1 |
hex | 785408da9b3d |
132302321130301 has 16 divisors (see below), whose sum is σ = 160194725623296. Its totient is φ = 106666084797696.
The previous prime is 132302321130257. The next prime is 132302321130359. The reversal of 132302321130301 is 103031123203231.
It is a cyclic number.
It is not a de Polignac number, because 132302321130301 - 213 = 132302321122109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132302321130401) 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 15 ways as a sum of consecutive naturals, for example, 339384981 + ... + 339774586.
It is an arithmetic number, because the mean of its divisors is an integer number (10012170351456).
Almost surely, 2132302321130301 is an apocalyptic number.
It is an amenable number.
132302321130301 is a deficient number, since it is larger than the sum of its proper divisors (27892404492995).
132302321130301 is a wasteful number, since it uses less digits than its factorization.
132302321130301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679161228.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 132302321130301 its reverse (103031123203231), we get a palindrome (235333444333532).
The spelling of 132302321130301 in words is "one hundred thirty-two trillion, three hundred two billion, three hundred twenty-one million, one hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •