Base | Representation |
---|---|
bin | 1100010010000… |
… | …00110011110001 |
3 | 21011212020222021 |
4 | 12021000303301 |
5 | 202333312110 |
6 | 14120111441 |
7 | 2360464033 |
oct | 611006361 |
9 | 234766867 |
10 | 103025905 |
11 | 53178984 |
12 | 2a605581 |
13 | 18462b98 |
14 | d97bc53 |
15 | 90a12da |
hex | 6240cf1 |
103025905 has 8 divisors (see below), whose sum is σ = 125964072. Its totient is φ = 80865408.
The previous prime is 103025891. The next prime is 103025917. The reversal of 103025905 is 509520301.
It can be written as a sum of positive squares in 4 ways, for example, as 46730896 + 56295009 = 6836^2 + 7503^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103025905 - 29 = 103025393 is a prime.
It is a super-2 number, since 2×1030259052 = 21228674202138050, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103025905.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 194124 + ... + 194653.
It is an arithmetic number, because the mean of its divisors is an integer number (15745509).
Almost surely, 2103025905 is an apocalyptic number.
It is an amenable number.
103025905 is a deficient number, since it is larger than the sum of its proper divisors (22938167).
103025905 is an equidigital number, since it uses as much as digits as its factorization.
103025905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388835.
The product of its (nonzero) digits is 1350, while the sum is 25.
The square root of 103025905 is about 10150.1677326042. The cubic root of 103025905 is about 468.7941095084.
The spelling of 103025905 in words is "one hundred three million, twenty-five thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •