Base | Representation |
---|---|
bin | 110000011101101010… |
… | …1110100011101101000 |
3 | 100221122011002011100000 |
4 | 1200323111310131220 |
5 | 3201121121301020 |
6 | 115451123543000 |
7 | 10343033060643 |
oct | 1407325643550 |
9 | 327564064300 |
10 | 104074790760 |
11 | 40157562776 |
12 | 1820652aa60 |
13 | 9a77a89435 |
14 | 50742c2a5a |
15 | 2a91d35090 |
hex | 183b574768 |
104074790760 has 96 divisors (see below), whose sum is σ = 350770623840. Its totient is φ = 27753274944.
The previous prime is 104074790737. The next prime is 104074790761. The reversal of 104074790760 is 67097470401.
104074790760 is a `hidden beast` number, since 104 + 0 + 7 + 479 + 0 + 76 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (104074790761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5343922 + ... + 5363361.
It is an arithmetic number, because the mean of its divisors is an integer number (3653860665).
Almost surely, 2104074790760 is an apocalyptic number.
104074790760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104074790760 is an abundant number, since it is smaller than the sum of its proper divisors (246695833080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104074790760 is a wasteful number, since it uses less digits than its factorization.
104074790760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10707309 (or 10707293 counting only the distinct ones).
The product of its (nonzero) digits is 296352, while the sum is 45.
The spelling of 104074790760 in words is "one hundred four billion, seventy-four million, seven hundred ninety thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •