Base | Representation |
---|---|
bin | 1100010010001… |
… | …11001101110001 |
3 | 21011220120222010 |
4 | 12021013031301 |
5 | 202340132040 |
6 | 14120433133 |
7 | 2360633400 |
oct | 611071561 |
9 | 234816863 |
10 | 103052145 |
11 | 53196669 |
12 | 2a6187a9 |
13 | 18471b01 |
14 | d987637 |
15 | 90a8e80 |
hex | 6247371 |
103052145 has 24 divisors (see below), whose sum is σ = 191804544. Its totient is φ = 47109216.
The previous prime is 103052137. The next prime is 103052149. The reversal of 103052145 is 541250301.
It is not a de Polignac number, because 103052145 - 23 = 103052137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an alternating number because its digits alternate between odd and even.
It is not an unprimeable number, because it can be changed into a prime (103052149) 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 23 ways as a sum of consecutive naturals, for example, 69369 + ... + 70838.
It is an arithmetic number, because the mean of its divisors is an integer number (7991856).
Almost surely, 2103052145 is an apocalyptic number.
103052145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
103052145 is a deficient number, since it is larger than the sum of its proper divisors (88752399).
103052145 is a wasteful number, since it uses less digits than its factorization.
103052145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140229 (or 140222 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 103052145 is about 10151.4602397882. The cubic root of 103052145 is about 468.8339056912.
The spelling of 103052145 in words is "one hundred three million, fifty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •