Base | Representation |
---|---|
bin | 10111101010000011110000… |
… | …000010110000101111000010 |
3 | 111122101122010220020110202022 |
4 | 113222003300002300233002 |
5 | 102114134301122042200 |
6 | 1005141431411121442 |
7 | 30626011620450305 |
oct | 2752036002605702 |
9 | 448348126213668 |
10 | 104045315034050 |
11 | 30174408976605 |
12 | b8048195a3282 |
13 | 460957b1b55a0 |
14 | 1b99b6a588b3c |
15 | c066cdb96885 |
hex | 5ea0f00b0bc2 |
104045315034050 has 24 divisors (see below), whose sum is σ = 208410769500276. Its totient is φ = 38416731704640.
The previous prime is 104045315034043. The next prime is 104045315034077. The reversal of 104045315034050 is 50430513540401.
It can be written as a sum of positive squares in 6 ways, for example, as 1056165234601 + 102989149799449 = 1027699^2 + 10148357^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 104045315034050.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80034857069 + ... + 80034858368.
Almost surely, 2104045315034050 is an apocalyptic number.
104045315034050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104045315034050 is an abundant number, since it is smaller than the sum of its proper divisors (104365454466226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104045315034050 is a wasteful number, since it uses less digits than its factorization.
104045315034050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160069715462 (or 160069715457 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 104045315034050 its reverse (50430513540401), we get a palindrome (154475828574451).
The spelling of 104045315034050 in words is "one hundred four trillion, forty-five billion, three hundred fifteen million, thirty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •