Base | Representation |
---|---|
bin | 1100100010000… |
… | …00110111110011 |
3 | 21022210211002010 |
4 | 12101000313303 |
5 | 203402421230 |
6 | 14233054003 |
7 | 2414350653 |
oct | 621006763 |
9 | 238724063 |
10 | 105123315 |
11 | 54380780 |
12 | 2b257303 |
13 | 18a1875b |
14 | dd66363 |
15 | 93679b0 |
hex | 6440df3 |
105123315 has 32 divisors (see below), whose sum is σ = 184375296. Its totient is φ = 50722560.
The previous prime is 105123311. The next prime is 105123323. The reversal of 105123315 is 513321501.
It is not a de Polignac number, because 105123315 - 22 = 105123311 is a prime.
It is a super-2 number, since 2×1051233152 = 22101822713178450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105123291 and 105123300.
It is not an unprimeable number, because it can be changed into a prime (105123311) 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 31 ways as a sum of consecutive naturals, for example, 35367 + ... + 38223.
It is an arithmetic number, because the mean of its divisors is an integer number (5761728).
Almost surely, 2105123315 is an apocalyptic number.
105123315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105123315 is a deficient number, since it is larger than the sum of its proper divisors (79251981).
105123315 is a wasteful number, since it uses less digits than its factorization.
105123315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3099.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 105123315 is about 10252.9661561911. The cubic root of 105123315 is about 471.9540122652.
Adding to 105123315 its reverse (513321501), we get a palindrome (618444816).
The spelling of 105123315 in words is "one hundred five million, one hundred twenty-three thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •