Base | Representation |
---|---|
bin | 1100010011100… |
… | …01001100110011 |
3 | 21012020022212101 |
4 | 12021301030303 |
5 | 202411132430 |
6 | 14124241231 |
7 | 2362250641 |
oct | 611611463 |
9 | 235208771 |
10 | 103224115 |
11 | 532a3895 |
12 | 2a6a0217 |
13 | 18502177 |
14 | d9d0191 |
15 | 90dedca |
hex | 6271333 |
103224115 has 8 divisors (see below), whose sum is σ = 129254688. Its totient is φ = 78988800.
The previous prime is 103224113. The next prime is 103224181. The reversal of 103224115 is 511422301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103224115 - 21 = 103224113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103224092 and 103224101.
It is not an unprimeable number, because it can be changed into a prime (103224113) 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, 448686 + ... + 448915.
It is an arithmetic number, because the mean of its divisors is an integer number (16156836).
Almost surely, 2103224115 is an apocalyptic number.
103224115 is a deficient number, since it is larger than the sum of its proper divisors (26030573).
103224115 is an equidigital number, since it uses as much as digits as its factorization.
103224115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897629.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 103224115 is about 10159.9269190285. The cubic root of 103224115 is about 469.0945522470.
Adding to 103224115 its reverse (511422301), we get a palindrome (614646416).
It can be divided in two parts, 1032241 and 15, that added together give a square (1032256 = 10162).
The spelling of 103224115 in words is "one hundred three million, two hundred twenty-four thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •