Base | Representation |
---|---|
bin | 1100000000100101110110111… |
… | …0010110111011011010111010 |
3 | 11002211011102010011122002010000 |
4 | 3000021131232112323122322 |
5 | 1341231203224323313403 |
6 | 12153154124320133430 |
7 | 343000451161401030 |
oct | 30011355626733272 |
9 | 4084142104562100 |
10 | 845075321697978 |
11 | 2252a3482037398 |
12 | 7a945313467276 |
13 | 2a370351257777 |
14 | 10c97c1440c550 |
15 | 67a75360aa7a3 |
hex | 300976e5bb6ba |
845075321697978 has 160 divisors (see below), whose sum is σ = 2217259732267008. Its totient is φ = 235553002884000.
The previous prime is 845075321697869. The next prime is 845075321698031. The reversal of 845075321697978 is 879796123570548.
845075321697978 is a `hidden beast` number, since 8 + 4 + 5 + 0 + 7 + 532 + 1 + 6 + 9 + 7 + 9 + 78 = 666.
It is a Harshad number since it is a multiple of its sum of digits (81).
It is a junction number, because it is equal to n+sod(n) for n = 845075321697897 and 845075321697906.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 8915748 + ... + 42067103.
It is a 1-persistent number, because it is pandigital, but 2⋅845075321697978 = 1690150643395956 is not.
Almost surely, 2845075321697978 is an apocalyptic number.
845075321697978 is an abundant number, since it is smaller than the sum of its proper divisors (1372184410569030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
845075321697978 is a wasteful number, since it uses less digits than its factorization.
845075321697978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50983230 (or 50983221 counting only the distinct ones).
The product of its (nonzero) digits is 6401203200, while the sum is 81.
The spelling of 845075321697978 in words is "eight hundred forty-five trillion, seventy-five billion, three hundred twenty-one million, six hundred ninety-seven thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •