Base | Representation |
---|---|
bin | 11110000010110011100110… |
… | …101011101111011000100111 |
3 | 122022211220120122212000122011 |
4 | 132002303212223233120213 |
5 | 114304341412443320403 |
6 | 1145005344520215051 |
7 | 36555245514333061 |
oct | 3602634653573047 |
9 | 568756518760564 |
10 | 132134244120103 |
11 | 39113900089415 |
12 | 129a060300a487 |
13 | 589628a076a44 |
14 | 248b48da56731 |
15 | 10421accd1a6d |
hex | 782ce6aef627 |
132134244120103 has 8 divisors (see below), whose sum is σ = 132454984663280. Its totient is φ = 131813536196160.
The previous prime is 132134244120101. The next prime is 132134244120113. The reversal of 132134244120103 is 301021442431231.
It is a happy number.
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 132134244120103 - 21 = 132134244120101 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 (132134244120101) 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, 33558 + ... + 16256371.
It is an arithmetic number, because the mean of its divisors is an integer number (16556873082910).
Almost surely, 2132134244120103 is an apocalyptic number.
132134244120103 is a deficient number, since it is larger than the sum of its proper divisors (320740543177).
132134244120103 is a wasteful number, since it uses less digits than its factorization.
132134244120103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16309617.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 132134244120103 its reverse (301021442431231), we get a palindrome (433155686551334).
The spelling of 132134244120103 in words is "one hundred thirty-two trillion, one hundred thirty-four billion, two hundred forty-four million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •