Base | Representation |
---|---|
bin | 1100011111001… |
… | …00101111110100 |
3 | 21022002122110110 |
4 | 12033210233310 |
5 | 203303332342 |
6 | 14221023020 |
7 | 2411216562 |
oct | 617445764 |
9 | 238078413 |
10 | 104745972 |
11 | 54143221 |
12 | 2b0b4a70 |
13 | 18915a86 |
14 | dca8a32 |
15 | 92e0c9c |
hex | 63e4bf4 |
104745972 has 24 divisors (see below), whose sum is σ = 245490336. Its totient is φ = 34760608.
The previous prime is 104745961. The next prime is 104745983. The reversal of 104745972 is 279547401.
It is an interprime number because it is at equal distance from previous prime (104745961) and next prime (104745983).
It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 104745972.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16503 + ... + 21950.
It is an arithmetic number, because the mean of its divisors is an integer number (10228764).
Almost surely, 2104745972 is an apocalyptic number.
104745972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104745972 is an abundant number, since it is smaller than the sum of its proper divisors (140744364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104745972 is a wasteful number, since it uses less digits than its factorization.
104745972 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38687 (or 38685 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 39.
The square root of 104745972 is about 10234.5479626606. The cubic root of 104745972 is about 471.3886379922.
The spelling of 104745972 in words is "one hundred four million, seven hundred forty-five thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •