Base | Representation |
---|---|
bin | 1100010010111… |
… | …11001111010111 |
3 | 21012002120221210 |
4 | 12021133033113 |
5 | 202401304201 |
6 | 14122512503 |
7 | 2361523320 |
oct | 611371727 |
9 | 235076853 |
10 | 103150551 |
11 | 53253599 |
12 | 2a665733 |
13 | 184a783a |
14 | d9b1447 |
15 | 90c81d6 |
hex | 625f3d7 |
103150551 has 8 divisors (see below), whose sum is σ = 157181824. Its totient is φ = 58943160.
The previous prime is 103150549. The next prime is 103150583. The reversal of 103150551 is 155051301.
103150551 = T1778 + T1779 + ... + T1840.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103150551 - 21 = 103150549 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4911931 = 103150551 / (1 + 0 + 3 + 1 + 5 + 0 + 5 + 5 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103150501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2455945 + ... + 2455986.
It is an arithmetic number, because the mean of its divisors is an integer number (19647728).
Almost surely, 2103150551 is an apocalyptic number.
103150551 is a deficient number, since it is larger than the sum of its proper divisors (54031273).
103150551 is an equidigital number, since it uses as much as digits as its factorization.
103150551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4911941.
The product of its (nonzero) digits is 375, while the sum is 21.
The square root of 103150551 is about 10156.3059721535. The cubic root of 103150551 is about 468.9830903322.
The spelling of 103150551 in words is "one hundred three million, one hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •