Base | Representation |
---|---|
bin | 1100010010000… |
… | …01111101001101 |
3 | 21011212111102100 |
4 | 12021001331031 |
5 | 202333434410 |
6 | 14120145313 |
7 | 2360513526 |
oct | 611017515 |
9 | 234774370 |
10 | 103030605 |
11 | 53181467 |
12 | 2a608239 |
13 | 18465072 |
14 | d97d84d |
15 | 90a28c0 |
hex | 6241f4d |
103030605 has 24 divisors (see below), whose sum is σ = 180362520. Its totient is φ = 54403200.
The previous prime is 103030589. The next prime is 103030619. The reversal of 103030605 is 506030301.
103030605 is a `hidden beast` number, since 1 + 0 + 30 + 30 + 605 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 65318724 + 37711881 = 8082^2 + 6141^2 .
It is not a de Polignac number, because 103030605 - 24 = 103030589 is a prime.
It is a congruent number.
It is an unprimeable number.
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, 6790 + ... + 15879.
It is an arithmetic number, because the mean of its divisors is an integer number (7515105).
Almost surely, 2103030605 is an apocalyptic number.
103030605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
103030605 is a deficient number, since it is larger than the sum of its proper divisors (77331915).
103030605 is a wasteful number, since it uses less digits than its factorization.
103030605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22781 (or 22778 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 18.
The square root of 103030605 is about 10150.3992532314. The cubic root of 103030605 is about 468.8012381324.
Adding to 103030605 its reverse (506030301), we get a palindrome (609060906).
The spelling of 103030605 in words is "one hundred three million, thirty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •