Search a number
-
+
104667072 = 263545141
BaseRepresentation
bin1100011110100…
…01011111000000
321021221122020020
412033101133000
5203243321242
614215213440
72410440546
oct617213700
9237848206
10104667072
1154099a14
122b077280
13188b8ba3
14dc87d96
1592c76ec
hex63d17c0

104667072 has 28 divisors (see below), whose sum is σ = 276932136. Its totient is φ = 34888960.

The previous prime is 104667071. The next prime is 104667091. The reversal of 104667072 is 270766401.

It is a super-2 number, since 2×1046670722 = 21910391922106368, which contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (104667071) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 272379 + ... + 272762.

Almost surely, 2104667072 is an apocalyptic number.

104667072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

104667072 is an abundant number, since it is smaller than the sum of its proper divisors (172265064).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

104667072 is an equidigital number, since it uses as much as digits as its factorization.

104667072 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 545156 (or 545146 counting only the distinct ones).

The product of its (nonzero) digits is 14112, while the sum is 33.

The square root of 104667072 is about 10230.6926451732. The cubic root of 104667072 is about 471.2702502866.

The spelling of 104667072 in words is "one hundred four million, six hundred sixty-seven thousand, seventy-two".

Divisors: 1 2 3 4 6 8 12 16 24 32 48 64 96 192 545141 1090282 1635423 2180564 3270846 4361128 6541692 8722256 13083384 17444512 26166768 34889024 52333536 104667072