Base | Representation |
---|---|
bin | 1100011000110… |
… | …11100011101000 |
3 | 21020112210001010 |
4 | 12030123203220 |
5 | 203101000041 |
6 | 14151223520 |
7 | 2401215201 |
oct | 614334350 |
9 | 236483033 |
10 | 103921896 |
11 | 53730071 |
12 | 2a977ba0 |
13 | 186b7960 |
14 | db325a8 |
15 | 91cba16 |
hex | 631b8e8 |
103921896 has 64 divisors (see below), whose sum is σ = 280828800. Its totient is φ = 31857408.
The previous prime is 103921861. The next prime is 103921897. The reversal of 103921896 is 698129301.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (103921897) 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 15 ways as a sum of consecutive naturals, for example, 123445 + ... + 124283.
It is an arithmetic number, because the mean of its divisors is an integer number (4387950).
Almost surely, 2103921896 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103921896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140414400).
103921896 is an abundant number, since it is smaller than the sum of its proper divisors (176906904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103921896 is a wasteful number, since it uses less digits than its factorization.
103921896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1258 (or 1254 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 39.
The square root of 103921896 is about 10194.2089442977. The cubic root of 103921896 is about 470.1491845717.
The spelling of 103921896 in words is "one hundred three million, nine hundred twenty-one thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •