Base | Representation |
---|---|
bin | 1100001110010… |
… | …01101011110100 |
3 | 21010221110122200 |
4 | 12013021223310 |
5 | 202222203342 |
6 | 14101424500 |
7 | 2353362345 |
oct | 607115364 |
9 | 233843580 |
10 | 102537972 |
11 | 52975329 |
12 | 2a40b130 |
13 | 18321a74 |
14 | d8920cc |
15 | 900694c |
hex | 61c9af4 |
102537972 has 36 divisors (see below), whose sum is σ = 265224960. Its totient is φ = 33383952.
The previous prime is 102537949. The next prime is 102537977. The reversal of 102537972 is 279735201.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102537977) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31572 + ... + 34667.
It is an arithmetic number, because the mean of its divisors is an integer number (7367360).
Almost surely, 2102537972 is an apocalyptic number.
102537972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102537972 is an abundant number, since it is smaller than the sum of its proper divisors (162686988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102537972 is a wasteful number, since it uses less digits than its factorization.
102537972 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66292 (or 66287 counting only the distinct ones).
The product of its (nonzero) digits is 26460, while the sum is 36.
The square root of 102537972 is about 10126.1034954221. The cubic root of 102537972 is about 468.0528649464.
It can be divided in two parts, 10253 and 7972, that added together give a square (18225 = 1352).
The spelling of 102537972 in words is "one hundred two million, five hundred thirty-seven thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •