Base | Representation |
---|---|
bin | 1100100000100… |
… | …01011011001100 |
3 | 21022102221111020 |
4 | 12100101123030 |
5 | 203330211342 |
6 | 14224554140 |
7 | 2412611241 |
oct | 620213314 |
9 | 238387436 |
10 | 104928972 |
11 | 54258765 |
12 | 2b182950 |
13 | 1897b165 |
14 | dd155c8 |
15 | 932a0ec |
hex | 64116cc |
104928972 has 12 divisors (see below), whose sum is σ = 244834296. Its totient is φ = 34976320.
The previous prime is 104928961. The next prime is 104928973. The reversal of 104928972 is 279829401.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1049289722 = 22020178329953568, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104928973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4372029 + ... + 4372052.
It is an arithmetic number, because the mean of its divisors is an integer number (20402858).
Almost surely, 2104928972 is an apocalyptic number.
104928972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104928972 is an abundant number, since it is smaller than the sum of its proper divisors (139905324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104928972 is a wasteful number, since it uses less digits than its factorization.
104928972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8744088 (or 8744086 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 42.
The square root of 104928972 is about 10243.4843681240. The cubic root of 104928972 is about 471.6629967764.
The spelling of 104928972 in words is "one hundred four million, nine hundred twenty-eight thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •