Base | Representation |
---|---|
bin | 10111101110100110100011… |
… | …011110101110001111011001 |
3 | 111200111111010000010021122220 |
4 | 113232212203132232033121 |
5 | 102134243242130141331 |
6 | 1005541111435334253 |
7 | 30660404461463646 |
oct | 2756464336561731 |
9 | 450444100107586 |
10 | 104357563130841 |
11 | 30284880878249 |
12 | b8552408b1389 |
13 | 462cb506a3037 |
14 | 1baad0c24adcd |
15 | c0e8a6781296 |
hex | 5ee9a37ae3d9 |
104357563130841 has 16 divisors (see below), whose sum is σ = 139171663123200. Its totient is φ = 69557587223168.
The previous prime is 104357563130833. The next prime is 104357563130869. The reversal of 104357563130841 is 148031365753401.
It is a cyclic number.
It is not a de Polignac number, because 104357563130841 - 23 = 104357563130833 is a prime.
It is a super-3 number, since 3×1043575631308413 (a number of 43 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104357563130831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 352686805 + ... + 352982573.
It is an arithmetic number, because the mean of its divisors is an integer number (8698228945200).
Almost surely, 2104357563130841 is an apocalyptic number.
It is an amenable number.
104357563130841 is a deficient number, since it is larger than the sum of its proper divisors (34814099992359).
104357563130841 is a wasteful number, since it uses less digits than its factorization.
104357563130841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319248.
The product of its (nonzero) digits is 3628800, while the sum is 51.
The spelling of 104357563130841 in words is "one hundred four trillion, three hundred fifty-seven billion, five hundred sixty-three million, one hundred thirty thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •