Base | Representation |
---|---|
bin | 1100110001010… |
… | …11010110000011 |
3 | 21110120212212122 |
4 | 12120223112003 |
5 | 204411213131 |
6 | 14344114455 |
7 | 2440416020 |
oct | 630532603 |
9 | 243525778 |
10 | 107132291 |
11 | 55523092 |
12 | 2ba65a2b |
13 | 1926ccb6 |
14 | 1032a547 |
15 | 9612d7b |
hex | 662b583 |
107132291 has 8 divisors (see below), whose sum is σ = 122731104. Its totient is φ = 91607040.
The previous prime is 107132281. The next prime is 107132297. The reversal of 107132291 is 192231701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107132291 - 210 = 107131267 is a prime.
It is a super-2 number, since 2×1071322912 = 22954655549817362, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107132291.
It is not an unprimeable number, because it can be changed into a prime (107132297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15230 + ... + 21123.
It is an arithmetic number, because the mean of its divisors is an integer number (15341388).
Almost surely, 2107132291 is an apocalyptic number.
107132291 is a deficient number, since it is larger than the sum of its proper divisors (15598813).
107132291 is an equidigital number, since it uses as much as digits as its factorization.
107132291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36781.
The product of its (nonzero) digits is 756, while the sum is 26.
The square root of 107132291 is about 10350.4729843616. The cubic root of 107132291 is about 474.9415122815.
Adding to 107132291 its reverse (192231701), we get a palindrome (299363992).
The spelling of 107132291 in words is "one hundred seven million, one hundred thirty-two thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •