Base | Representation |
---|---|
bin | 1100110001011… |
… | …10111110001111 |
3 | 21110121122021000 |
4 | 12120232332033 |
5 | 204412202101 |
6 | 14344311343 |
7 | 2440510236 |
oct | 630567617 |
9 | 243548230 |
10 | 107147151 |
11 | 55533271 |
12 | 2ba72553 |
13 | 192769a7 |
14 | 10331b1d |
15 | 9617486 |
hex | 662ef8f |
107147151 has 16 divisors (see below), whose sum is σ = 158993920. Its totient is φ = 71315640.
The previous prime is 107147111. The next prime is 107147203. The reversal of 107147151 is 151741701.
It is not a de Polignac number, because 107147151 - 213 = 107138959 is a prime.
It is a super-2 number, since 2×1071471512 = 22961023934833602, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107147111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15786 + ... + 21528.
It is an arithmetic number, because the mean of its divisors is an integer number (9937120).
Almost surely, 2107147151 is an apocalyptic number.
107147151 is a deficient number, since it is larger than the sum of its proper divisors (51846769).
107147151 is an equidigital number, since it uses as much as digits as its factorization.
107147151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6443 (or 6437 counting only the distinct ones).
The product of its (nonzero) digits is 980, while the sum is 27.
The square root of 107147151 is about 10351.1908010625. The cubic root of 107147151 is about 474.9634705057.
Adding to 107147151 its reverse (151741701), we get a palindrome (258888852).
The spelling of 107147151 in words is "one hundred seven million, one hundred forty-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •