Base | Representation |
---|---|
bin | 100100101000101001100… |
… | …1000100111010001010001 |
3 | 122211100110112020220012101 |
4 | 1021101103020213101101 |
5 | 1124443334142002331 |
6 | 14413031423000401 |
7 | 1026526245363301 |
oct | 111212310472121 |
9 | 18740415226171 |
10 | 5035096437841 |
11 | 1671410746798 |
12 | 693a03739101 |
13 | 2a6a66282252 |
14 | 1359b29d7601 |
15 | 8ae939a1061 |
hex | 49453227451 |
5035096437841 has 8 divisors (see below), whose sum is σ = 5075252208000. Its totient is φ = 4995074298480.
The previous prime is 5035096437799. The next prime is 5035096437859. The reversal of 5035096437841 is 1487346905305.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5035096437841 - 27 = 5035096437713 is a prime.
It is a super-2 number, since 2×50350964378412 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5035096437881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33332041 + ... + 33482758.
It is an arithmetic number, because the mean of its divisors is an integer number (634406526000).
Almost surely, 25035096437841 is an apocalyptic number.
It is an amenable number.
5035096437841 is a deficient number, since it is larger than the sum of its proper divisors (40155770159).
5035096437841 is a wasteful number, since it uses less digits than its factorization.
5035096437841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66815399.
The product of its (nonzero) digits is 10886400, while the sum is 55.
The spelling of 5035096437841 in words is "five trillion, thirty-five billion, ninety-six million, four hundred thirty-seven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •