Base | Representation |
---|---|
bin | 11110000010010111110000… |
… | …010101001101000001110101 |
3 | 122022202001101200020222002102 |
4 | 132002113300111031001311 |
5 | 114303344142322311201 |
6 | 1144543521353151445 |
7 | 36553136503661552 |
oct | 3602276025150165 |
9 | 568661350228072 |
10 | 132104341213301 |
11 | 391021557309a6 |
12 | 129968586bb585 |
13 | 5893502b48352 |
14 | 2489c54483a29 |
15 | 104150c98626b |
hex | 7825f054d075 |
132104341213301 has 8 divisors (see below), whose sum is σ = 133987683639744. Its totient is φ = 130221629839840.
The previous prime is 132104341213237. The next prime is 132104341213309. The reversal of 132104341213301 is 103312143401231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132104341213301 - 26 = 132104341213237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132104341213309) 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, 157341575 + ... + 158178948.
It is an arithmetic number, because the mean of its divisors is an integer number (16748460454968).
Almost surely, 2132104341213301 is an apocalyptic number.
It is an amenable number.
132104341213301 is a deficient number, since it is larger than the sum of its proper divisors (1883342426443).
132104341213301 is an equidigital number, since it uses as much as digits as its factorization.
132104341213301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315526491.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 132104341213301 its reverse (103312143401231), we get a palindrome (235416484614532).
The spelling of 132104341213301 in words is "one hundred thirty-two trillion, one hundred four billion, three hundred forty-one million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •