Base | Representation |
---|---|
bin | 10111101001101100011001… |
… | …100001000100111101111100 |
3 | 111122022020102110002202202010 |
4 | 113221230121201010331330 |
5 | 102113231423201341244 |
6 | 1005122123344331220 |
7 | 30624133354161444 |
oct | 2751543141047574 |
9 | 448266373082663 |
10 | 104020241043324 |
11 | 301648112a3221 |
12 | b7bb9a0313b10 |
13 | 46070b3543c98 |
14 | 1b9886c461124 |
15 | c05c1275aeb9 |
hex | 5e9b19844f7c |
104020241043324 has 48 divisors (see below), whose sum is σ = 255539751264000. Its totient is φ = 32841883466496.
The previous prime is 104020241043319. The next prime is 104020241043451. The reversal of 104020241043324 is 423340142020401.
It is a super-2 number, since 2×1040202410433242 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104020241043291 and 104020241043300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44793549 + ... + 47058500.
It is an arithmetic number, because the mean of its divisors is an integer number (5323744818000).
Almost surely, 2104020241043324 is an apocalyptic number.
It is an amenable number.
104020241043324 is an abundant number, since it is smaller than the sum of its proper divisors (151519510220676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104020241043324 is a wasteful number, since it uses less digits than its factorization.
104020241043324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91857042 (or 91857040 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 104020241043324 its reverse (423340142020401), we get a palindrome (527360383063725).
The spelling of 104020241043324 in words is "one hundred four trillion, twenty billion, two hundred forty-one million, forty-three thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •