Base | Representation |
---|---|
bin | 1100010110000… |
… | …10000101110001 |
3 | 21012212011100201 |
4 | 12023002011301 |
5 | 203002233231 |
6 | 14135315201 |
7 | 2365130623 |
oct | 613020561 |
9 | 235764321 |
10 | 103555441 |
11 | 534aa810 |
12 | 2a81bb01 |
13 | 185b9c12 |
14 | da78c13 |
15 | 9158161 |
hex | 62c2171 |
103555441 has 8 divisors (see below), whose sum is σ = 113045184. Its totient is φ = 94078320.
The previous prime is 103555427. The next prime is 103555451. The reversal of 103555441 is 144555301.
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 103555441 - 25 = 103555409 is a prime.
It is a super-3 number, since 3×1035554413 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103555411) by changing a digit.
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, 24876 + ... + 28738.
It is an arithmetic number, because the mean of its divisors is an integer number (14130648).
Almost surely, 2103555441 is an apocalyptic number.
103555441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103555441 is a deficient number, since it is larger than the sum of its proper divisors (9489743).
103555441 is a wasteful number, since it uses less digits than its factorization.
103555441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6311.
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 103555441 is about 10176.2193863930. The cubic root of 103555441 is about 469.5959119225.
The spelling of 103555441 in words is "one hundred three million, five hundred fifty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •