Base | Representation |
---|---|
bin | 110000111010000101… |
… | …011010101010111001 |
3 | 12000112210112222202102 |
4 | 300322011122222321 |
5 | 1330022102343131 |
6 | 40042531313145 |
7 | 3536230351655 |
oct | 607205325271 |
9 | 160483488672 |
10 | 52514106041 |
11 | 202a8931141 |
12 | a216a4b7b5 |
13 | 4c4b89a937 |
14 | 27825b3a65 |
15 | 157545a1cb |
hex | c3a15aab9 |
52514106041 has 8 divisors (see below), whose sum is σ = 52722641664. Its totient is φ = 52305638080.
The previous prime is 52514106011. The next prime is 52514106067. The reversal of 52514106041 is 14060141525.
52514106041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-52514106041 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 52514105995 and 52514106013.
It is not an unprimeable number, because it can be changed into a prime (52514106011) 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, 2019281 + ... + 2045121.
It is an arithmetic number, because the mean of its divisors is an integer number (6590330208).
Almost surely, 252514106041 is an apocalyptic number.
It is an amenable number.
52514106041 is a deficient number, since it is larger than the sum of its proper divisors (208535623).
52514106041 is a wasteful number, since it uses less digits than its factorization.
52514106041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33831.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 52514106041 its reverse (14060141525), we get a palindrome (66574247566).
The spelling of 52514106041 in words is "fifty-two billion, five hundred fourteen million, one hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.071 sec. • engine limits •