Base | Representation |
---|---|
bin | 10111001101010100101101… |
… | …01101111101100010111001 |
3 | 20200200221002220021210010111 |
4 | 23212222112231331202321 |
5 | 23142130323442321131 |
6 | 300313150145144321 |
7 | 13515116024525152 |
oct | 1346522655754271 |
9 | 220627086253114 |
10 | 51035330042041 |
11 | 15296a64358534 |
12 | 5882ba492b0a1 |
13 | 22627c33cb427 |
14 | c861a1d10929 |
15 | 5d782cdebab1 |
hex | 2e6a96b7d8b9 |
51035330042041 has 8 divisors (see below), whose sum is σ = 51473976577760. Its totient is φ = 50598214559712.
The previous prime is 51035330041957. The next prime is 51035330042057. The reversal of 51035330042041 is 14024003353015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51035330042041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51035330041994 and 51035330042012.
It is not an unprimeable number, because it can be changed into a prime (51035330942041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 382696395 + ... + 382829728.
It is an arithmetic number, because the mean of its divisors is an integer number (6434247072220).
Almost surely, 251035330042041 is an apocalyptic number.
It is an amenable number.
51035330042041 is a deficient number, since it is larger than the sum of its proper divisors (438646535719).
51035330042041 is a wasteful number, since it uses less digits than its factorization.
51035330042041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765526695.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 51035330042041 its reverse (14024003353015), we get a palindrome (65059333395056).
The spelling of 51035330042041 in words is "fifty-one trillion, thirty-five billion, three hundred thirty million, forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •