Base | Representation |
---|---|
bin | 1100010001111… |
… | …01011111010001 |
3 | 21011211120022120 |
4 | 12020331133101 |
5 | 202332343210 |
6 | 14115524453 |
7 | 2360406264 |
oct | 610753721 |
9 | 234746276 |
10 | 103012305 |
11 | 53169740 |
12 | 2a5b9729 |
13 | 18459936 |
14 | d976cdb |
15 | 909c270 |
hex | 623d7d1 |
103012305 has 32 divisors (see below), whose sum is σ = 183997440. Its totient is φ = 48780480.
The previous prime is 103012229. The next prime is 103012307. The reversal of 103012305 is 503210301.
It is a happy number.
It is not a de Polignac number, because 103012305 - 210 = 103011281 is a prime.
It is a super-2 number, since 2×1030123052 = 21223069962826050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
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 (103012307) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 165 + ... + 14354.
It is an arithmetic number, because the mean of its divisors is an integer number (5749920).
Almost surely, 2103012305 is an apocalyptic number.
103012305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
103012305 is a deficient number, since it is larger than the sum of its proper divisors (80985135).
103012305 is a wasteful number, since it uses less digits than its factorization.
103012305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14581.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 103012305 is about 10149.4977708259. The cubic root of 103012305 is about 468.7734807793.
Adding to 103012305 its reverse (503210301), we get a palindrome (606222606).
The spelling of 103012305 in words is "one hundred three million, twelve thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •