Base | Representation |
---|---|
bin | 1101110111011… |
… | …11101111000011 |
3 | 22002212221100000 |
4 | 12323233233003 |
5 | 214234402230 |
6 | 15313131043 |
7 | 2611514601 |
oct | 673575703 |
9 | 262787300 |
10 | 116325315 |
11 | 5a731a27 |
12 | 32b59a83 |
13 | 1b13b462 |
14 | 11640871 |
15 | a32bb60 |
hex | 6eefbc3 |
116325315 has 48 divisors (see below), whose sum is σ = 220147200. Its totient is φ = 58763232.
The previous prime is 116325311. The next prime is 116325337. The reversal of 116325315 is 513523611.
116325315 is a `hidden beast` number, since 11 + 632 + 5 + 3 + 15 = 666.
It is not a de Polignac number, because 116325315 - 22 = 116325311 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (116325311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20566 + ... + 25604.
It is an arithmetic number, because the mean of its divisors is an integer number (4586400).
Almost surely, 2116325315 is an apocalyptic number.
116325315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116325315 is a deficient number, since it is larger than the sum of its proper divisors (103821885).
116325315 is an equidigital number, since it uses as much as digits as its factorization.
116325315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5078 (or 5066 counting only the distinct ones).
The product of its digits is 2700, while the sum is 27.
The square root of 116325315 is about 10785.4214104040. The cubic root of 116325315 is about 488.1553788905.
Adding to 116325315 its reverse (513523611), we get a palindrome (629848926).
The spelling of 116325315 in words is "one hundred sixteen million, three hundred twenty-five thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •