Base | Representation |
---|---|
bin | 110000110011111001… |
… | …011100011011110001 |
3 | 12000021120020022110022 |
4 | 300303321130123301 |
5 | 1324314014213431 |
6 | 40024342413225 |
7 | 3533530143551 |
oct | 606371343361 |
9 | 160246208408 |
10 | 52410304241 |
11 | 20255283329 |
12 | a1a8131215 |
13 | 4c33225859 |
14 | 27728b3161 |
15 | 156b2a407b |
hex | c33e5c6f1 |
52410304241 has 4 divisors (see below), whose sum is σ = 55493263332. Its totient is φ = 49327345152.
The previous prime is 52410304231. The next prime is 52410304253. The reversal of 52410304241 is 14240301425.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18517494241 + 33892810000 = 136079^2 + 184100^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52410304241 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52410304241.
It is not an unprimeable number, because it can be changed into a prime (52410304231) 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, 1541479520 + ... + 1541479553.
It is an arithmetic number, because the mean of its divisors is an integer number (13873315833).
Almost surely, 252410304241 is an apocalyptic number.
It is an amenable number.
52410304241 is a deficient number, since it is larger than the sum of its proper divisors (3082959091).
52410304241 is a wasteful number, since it uses less digits than its factorization.
52410304241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3082959090.
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 52410304241 its reverse (14240301425), we get a palindrome (66650605666).
The spelling of 52410304241 in words is "fifty-two billion, four hundred ten million, three hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •