Base | Representation |
---|---|
bin | 10111101010010011010011… |
… | …001101000010000011000101 |
3 | 111122110020020110202021121200 |
4 | 113222103103031002003011 |
5 | 102114422444312300300 |
6 | 1005153232232533113 |
7 | 30630142433344140 |
oct | 2752232315020305 |
9 | 448406213667550 |
10 | 104062011056325 |
11 | 301804a6394223 |
12 | b807ab8b51199 |
13 | 460b00c2174ca |
14 | 1b9a8b1b3b057 |
15 | c06d59826200 |
hex | 5ea4d33420c5 |
104062011056325 has 144 divisors (see below), whose sum is σ = 214141368480000. Its totient is φ = 47319404774400.
The previous prime is 104062011056203. The next prime is 104062011056351. The reversal of 104062011056325 is 523650110260401.
104062011056325 is a `hidden beast` number, since 1 + 0 + 4 + 0 + 6 + 2 + 0 + 1 + 10 + 5 + 632 + 5 = 666.
It is not a de Polignac number, because 104062011056325 - 27 = 104062011056197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104062011056325.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 1216359651 + ... + 1216445199.
Almost surely, 2104062011056325 is an apocalyptic number.
104062011056325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104062011056325 is an abundant number, since it is smaller than the sum of its proper divisors (110079357423675).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104062011056325 is a wasteful number, since it uses less digits than its factorization.
104062011056325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89652 (or 89644 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 104062011056325 in words is "one hundred four trillion, sixty-two billion, eleven million, fifty-six thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •