Base | Representation |
---|---|
bin | 111101100000110000… |
… | …1000100100101111101 |
3 | 110121221222100101101221 |
4 | 1323001201010211331 |
5 | 4131012444104013 |
6 | 140403421033341 |
7 | 12354311564020 |
oct | 1730141044575 |
9 | 417858311357 |
10 | 132095691133 |
11 | 5102663497a |
12 | 217266b5851 |
13 | c5c2114363 |
14 | 65719531b7 |
15 | 3681d2908d |
hex | 1ec184497d |
132095691133 has 8 divisors (see below), whose sum is σ = 152785378368. Its totient is φ = 111860722464.
The previous prime is 132095691109. The next prime is 132095691149. The reversal of 132095691133 is 331196590231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132095691133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132095691133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132095691103) 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, 113679016 + ... + 113680177.
It is an arithmetic number, because the mean of its divisors is an integer number (19098172296).
Almost surely, 2132095691133 is an apocalyptic number.
It is an amenable number.
132095691133 is a deficient number, since it is larger than the sum of its proper divisors (20689687235).
132095691133 is an equidigital number, since it uses as much as digits as its factorization.
132095691133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227359283.
The product of its (nonzero) digits is 131220, while the sum is 43.
The spelling of 132095691133 in words is "one hundred thirty-two billion, ninety-five million, six hundred ninety-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •