Base | Representation |
---|---|
bin | 1100110001000… |
… | …01010101110011 |
3 | 21110111210200000 |
4 | 12120201111303 |
5 | 204403410230 |
6 | 14343201043 |
7 | 2440155402 |
oct | 630412563 |
9 | 243453600 |
10 | 107091315 |
11 | 554a5321 |
12 | 2ba46183 |
13 | 19257456 |
14 | 10319639 |
15 | 9605b60 |
hex | 6621573 |
107091315 has 48 divisors (see below), whose sum is σ = 202675200. Its totient is φ = 54097632.
The previous prime is 107091307. The next prime is 107091317. The reversal of 107091315 is 513190701.
It is a happy number.
It is not a de Polignac number, because 107091315 - 23 = 107091307 is a prime.
It is a super-2 number, since 2×1070913152 = 22937099496858450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107091317) 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 47 ways as a sum of consecutive naturals, for example, 20766 + ... + 25404.
It is an arithmetic number, because the mean of its divisors is an integer number (4222400).
Almost surely, 2107091315 is an apocalyptic number.
107091315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
107091315 is a deficient number, since it is larger than the sum of its proper divisors (95583885).
107091315 is an equidigital number, since it uses as much as digits as its factorization.
107091315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4678 (or 4666 counting only the distinct ones).
The product of its (nonzero) digits is 945, while the sum is 27.
The square root of 107091315 is about 10348.4933686020. The cubic root of 107091315 is about 474.8809526223.
The spelling of 107091315 in words is "one hundred seven million, ninety-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •