Base | Representation |
---|---|
bin | 1100011000011… |
… | …11000111010100 |
3 | 21020110012010120 |
4 | 12030033013110 |
5 | 203042332212 |
6 | 14150151540 |
7 | 2400613464 |
oct | 614170724 |
9 | 236405116 |
10 | 103870932 |
11 | 536a5850 |
12 | 2a9525b0 |
13 | 1869a6b9 |
14 | db1bba4 |
15 | 91bb88c |
hex | 630f1d4 |
103870932 has 24 divisors (see below), whose sum is σ = 264399072. Its totient is φ = 31476000.
The previous prime is 103870913. The next prime is 103870933. The reversal of 103870932 is 239078301.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 103870893 and 103870902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103870933) 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 7 ways as a sum of consecutive naturals, for example, 393319 + ... + 393582.
It is an arithmetic number, because the mean of its divisors is an integer number (11016628).
Almost surely, 2103870932 is an apocalyptic number.
103870932 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103870932 is an abundant number, since it is smaller than the sum of its proper divisors (160528140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103870932 is a wasteful number, since it uses less digits than its factorization.
103870932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786919 (or 786917 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 103870932 is about 10191.7089832864. The cubic root of 103870932 is about 470.0723172259.
The spelling of 103870932 in words is "one hundred three million, eight hundred seventy thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •