Base | Representation |
---|---|
bin | 1100010011000… |
… | …11101000000000 |
3 | 21012010111121000 |
4 | 12021203220000 |
5 | 202402343022 |
6 | 14123132000 |
7 | 2361626556 |
oct | 611435000 |
9 | 235114530 |
10 | 103168512 |
11 | 53266037 |
12 | 2a674000 |
13 | 184b2a75 |
14 | d9b7bd6 |
15 | 90cd6ac |
hex | 6263a00 |
103168512 has 160 divisors (see below), whose sum is σ = 324086400. Its totient is φ = 32292864.
The previous prime is 103168511. The next prime is 103168517. The reversal of 103168512 is 215861301.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (103168511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 234789 + ... + 235227.
It is an arithmetic number, because the mean of its divisors is an integer number (2025540).
Almost surely, 2103168512 is an apocalyptic number.
103168512 is a gapful number since it is divisible by the number (12) 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 103168512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162043200).
103168512 is an abundant number, since it is smaller than the sum of its proper divisors (220917888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103168512 is an equidigital number, since it uses as much as digits as its factorization.
103168512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483 (or 461 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 103168512 is about 10157.1901626385. The cubic root of 103168512 is about 469.0103091767.
The spelling of 103168512 in words is "one hundred three million, one hundred sixty-eight thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •