Base | Representation |
---|---|
bin | 10111101011000010001111… |
… | …100011010010110001011001 |
3 | 111122122001100020212212212010 |
4 | 113223002033203102301121 |
5 | 102121234211401230412 |
6 | 1005232330010140133 |
7 | 30633605500330020 |
oct | 2753021743226131 |
9 | 448561306785763 |
10 | 104112415648857 |
11 | 3019a911479670 |
12 | b815825421649 |
13 | 46129b2a45ca5 |
14 | 1b9d0d40a98b7 |
15 | c0830998a33c |
hex | 5eb08f8d2c59 |
104112415648857 has 64 divisors (see below), whose sum is σ = 173188854558720. Its totient is φ = 54047235225600.
The previous prime is 104112415648853. The next prime is 104112415648859. The reversal of 104112415648857 is 758846514211401.
It is a happy number.
104112415648857 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 104112415648857 - 22 = 104112415648853 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104112415648797 and 104112415648806.
It is not an unprimeable number, because it can be changed into a prime (104112415648853) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4233404353 + ... + 4233428945.
It is an arithmetic number, because the mean of its divisors is an integer number (2706075852480).
Almost surely, 2104112415648857 is an apocalyptic number.
It is an amenable number.
104112415648857 is a deficient number, since it is larger than the sum of its proper divisors (69076438909863).
104112415648857 is a wasteful number, since it uses less digits than its factorization.
104112415648857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36454.
The product of its (nonzero) digits is 8601600, while the sum is 57.
The spelling of 104112415648857 in words is "one hundred four trillion, one hundred twelve billion, four hundred fifteen million, six hundred forty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •