Base | Representation |
---|---|
bin | 1100010110001… |
… | …10111000110001 |
3 | 21012220011022102 |
4 | 12023012320301 |
5 | 203003400324 |
6 | 14135550145 |
7 | 2365242122 |
oct | 613067061 |
9 | 235804272 |
10 | 103575089 |
11 | 53513552 |
12 | 2a82b355 |
13 | 185c5b47 |
14 | da82049 |
15 | 915ddae |
hex | 62c6e31 |
103575089 has 4 divisors (see below), whose sum is σ = 105983856. Its totient is φ = 101166324.
The previous prime is 103575079. The next prime is 103575103. The reversal of 103575089 is 980575301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103575089 is a prime.
It is a super-3 number, since 3×1035750893 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103575029) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1204319 + ... + 1204404.
It is an arithmetic number, because the mean of its divisors is an integer number (26495964).
Almost surely, 2103575089 is an apocalyptic number.
It is an amenable number.
103575089 is a deficient number, since it is larger than the sum of its proper divisors (2408767).
103575089 is an equidigital number, since it uses as much as digits as its factorization.
103575089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2408766.
The product of its (nonzero) digits is 37800, while the sum is 38.
The square root of 103575089 is about 10177.1847285976. The cubic root of 103575089 is about 469.6256094994.
The spelling of 103575089 in words is "one hundred three million, five hundred seventy-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •