Base | Representation |
---|---|
bin | 1100010011110… |
… | …01010010000000 |
3 | 21012022000021100 |
4 | 12021321102000 |
5 | 202413212331 |
6 | 14125054400 |
7 | 2362446306 |
oct | 611712200 |
9 | 235260240 |
10 | 103257216 |
11 | 53316747 |
12 | 2a6b7400 |
13 | 1851425a |
14 | d9dc276 |
15 | 90e9ae6 |
hex | 6279480 |
103257216 has 48 divisors (see below), whose sum is σ = 297136710. Its totient is φ = 34418688.
The previous prime is 103257169. The next prime is 103257239. The reversal of 103257216 is 612752301.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 102090816 + 1166400 = 10104^2 + 1080^2 .
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-3 number, since 3×1032572163 (a number of 25 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103257216.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 43665 + ... + 45968.
Almost surely, 2103257216 is an apocalyptic number.
103257216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
103257216 is an abundant number, since it is smaller than the sum of its proper divisors (193879494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103257216 is an equidigital number, since it uses as much as digits as its factorization.
103257216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89653 (or 89638 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 103257216 is about 10161.5557863941. Note that the first 3 decimals coincide. The cubic root of 103257216 is about 469.1446885913.
The spelling of 103257216 in words is "one hundred three million, two hundred fifty-seven thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •