Base | Representation |
---|---|
bin | 10111101110100000000001… |
… | …00000000011001000011001 |
3 | 20211201220111100112012020120 |
4 | 23313100000200003020121 |
5 | 23314314423401110431 |
6 | 302544553314343453 |
7 | 13663352600000343 |
oct | 1367200040031031 |
9 | 224656440465216 |
10 | 52175271113241 |
11 | 15696454378481 |
12 | 5a27b0088ab89 |
13 | 2316150c95733 |
14 | cc5421c06293 |
15 | 6072ea0e4196 |
hex | 2f7400803219 |
52175271113241 has 4 divisors (see below), whose sum is σ = 69567028150992. Its totient is φ = 34783514075492.
The previous prime is 52175271113213. The next prime is 52175271113261. The reversal of 52175271113241 is 14231117257125.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 52175271113241 - 25 = 52175271113209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52175271113193 and 52175271113202.
It is not an unprimeable number, because it can be changed into a prime (52175271113261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8695878518871 + ... + 8695878518876.
It is an arithmetic number, because the mean of its divisors is an integer number (17391757037748).
Almost surely, 252175271113241 is an apocalyptic number.
It is an amenable number.
52175271113241 is a deficient number, since it is larger than the sum of its proper divisors (17391757037751).
52175271113241 is a wasteful number, since it uses less digits than its factorization.
52175271113241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17391757037750.
The product of its digits is 117600, while the sum is 42.
The spelling of 52175271113241 in words is "fifty-two trillion, one hundred seventy-five billion, two hundred seventy-one million, one hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •