Base | Representation |
---|---|
bin | 1100010010011… |
… | …01000100000000 |
3 | 21011221210211012 |
4 | 12021031010000 |
5 | 202341413341 |
6 | 14121140052 |
7 | 2361063254 |
oct | 611150400 |
9 | 234853735 |
10 | 103076096 |
11 | 53202662 |
12 | 2a62a628 |
13 | 1847c996 |
14 | d992264 |
15 | 90b10eb |
hex | 624d100 |
103076096 has 72 divisors (see below), whose sum is σ = 214570944. Its totient is φ = 49387520.
The previous prime is 103076093. The next prime is 103076101. The reversal of 103076096 is 690670301.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (103076093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 963275 + ... + 963381.
It is an arithmetic number, because the mean of its divisors is an integer number (2980152).
Almost surely, 2103076096 is an apocalyptic number.
103076096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103076096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107285472).
103076096 is an abundant number, since it is smaller than the sum of its proper divisors (111494848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103076096 is an equidigital number, since it uses as much as digits as its factorization.
103076096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247 (or 233 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 32.
The square root of 103076096 is about 10152.6398537523. The cubic root of 103076096 is about 468.8702244275.
The spelling of 103076096 in words is "one hundred three million, seventy-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •