Base | Representation |
---|---|
bin | 110000101111001111… |
… | …0100100010111110000 |
3 | 101000011020022122202010 |
4 | 1201132132210113300 |
5 | 3203323024133304 |
6 | 120025422522520 |
7 | 10363451521005 |
oct | 1413636442760 |
9 | 330136278663 |
10 | 104664286704 |
11 | 4042a2967aa |
12 | 1834ba36440 |
13 | 9b3cc47bc3 |
14 | 50cc6d38ac |
15 | 2ac897a789 |
hex | 185e7a45f0 |
104664286704 has 20 divisors (see below), whose sum is σ = 270382740776. Its totient is φ = 34888095552.
The previous prime is 104664286691. The next prime is 104664286709. The reversal of 104664286704 is 407682466401.
It is a super-2 number, since 2×1046642867042 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 2180505973 = 104664286704 / (1 + 0 + 4 + 6 + 6 + 4 + 2 + 8 + 6 + 7 + 0 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104664286709) 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 3 ways as a sum of consecutive naturals, for example, 1090252939 + ... + 1090253034.
Almost surely, 2104664286704 is an apocalyptic number.
It is an amenable number.
104664286704 is an abundant number, since it is smaller than the sum of its proper divisors (165718454072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104664286704 is a wasteful number, since it uses less digits than its factorization.
104664286704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2180505984 (or 2180505978 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 48.
The spelling of 104664286704 in words is "one hundred four billion, six hundred sixty-four million, two hundred eighty-six thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •