Base | Representation |
---|---|
bin | 1100010011101… |
… | …11011100000000 |
3 | 21012021121220122 |
4 | 12021313130000 |
5 | 202412442124 |
6 | 14124555412 |
7 | 2362415300 |
oct | 611673400 |
9 | 235247818 |
10 | 103249664 |
11 | 53311001 |
12 | 2a6b2b68 |
13 | 1851099b |
14 | d9d9600 |
15 | 90e775e |
hex | 6277700 |
103249664 has 54 divisors (see below), whose sum is σ = 239773464. Its totient is φ = 44244480.
The previous prime is 103249649. The next prime is 103249681. The reversal of 103249664 is 466942301.
It is a super-2 number, since 2×1032496642 = 21320986232225792, which contains 22 as substring.
It is a congruent number.
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, 8429 + ... + 16659.
Almost surely, 2103249664 is an apocalyptic number.
103249664 is a gapful number since it is divisible by the number (14) 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 103249664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119886732).
103249664 is an abundant number, since it is smaller than the sum of its proper divisors (136523800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103249664 is an frugal number, since it uses more digits than its factorization.
103249664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8261 (or 8240 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The square root of 103249664 is about 10161.1841829582. The cubic root of 103249664 is about 469.1332509175.
The spelling of 103249664 in words is "one hundred three million, two hundred forty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •