Base | Representation |
---|---|
bin | 110000111000000111… |
… | …1110001110001110000 |
3 | 101000221000021100102000 |
4 | 1201300033301301300 |
5 | 3204430333234334 |
6 | 120115152254000 |
7 | 10404031450035 |
oct | 1416017616160 |
9 | 330830240360 |
10 | 104962399344 |
11 | 405725a1190 |
12 | 18413841300 |
13 | 9b8993490a |
14 | 511a13538c |
15 | 2ae4c15299 |
hex | 18703f1c70 |
104962399344 has 80 divisors (see below), whose sum is σ = 328670154240. Its totient is φ = 31806786240.
The previous prime is 104962399309. The next prime is 104962399387. The reversal of 104962399344 is 443993269401.
104962399344 is a `hidden beast` number, since 1 + 0 + 4 + 9 + 623 + 9 + 9 + 3 + 4 + 4 = 666.
It is a super-2 number, since 2×1049623993442 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11039272 + ... + 11048775.
It is an arithmetic number, because the mean of its divisors is an integer number (4108376928).
Almost surely, 2104962399344 is an apocalyptic number.
It is an amenable number.
104962399344 is an abundant number, since it is smaller than the sum of its proper divisors (223707754896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104962399344 is a wasteful number, since it uses less digits than its factorization.
104962399344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22088075 (or 22088063 counting only the distinct ones).
The product of its (nonzero) digits is 5038848, while the sum is 54.
The spelling of 104962399344 in words is "one hundred four billion, nine hundred sixty-two million, three hundred ninety-nine thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •