Base | Representation |
---|---|
bin | 110001010000110000… |
… | …001110011110100001 |
3 | 12001112022012022002101 |
4 | 301100300032132201 |
5 | 1331311433131131 |
6 | 40144355050401 |
7 | 3551526132361 |
oct | 612060163641 |
9 | 161468168071 |
10 | 52894427041 |
11 | 20483585a15 |
12 | a3022a0a01 |
13 | 4cac60bc51 |
14 | 27bacd49a1 |
15 | 1598a32c61 |
hex | c50c0e7a1 |
52894427041 has 4 divisors (see below), whose sum is σ = 52896561732. Its totient is φ = 52892292352.
The previous prime is 52894427039. The next prime is 52894427051. The reversal of 52894427041 is 14072449825.
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 29707969600 + 23186457441 = 172360^2 + 152271^2 .
It is a cyclic number.
It is not a de Polignac number, because 52894427041 - 21 = 52894427039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52894426982 and 52894427000.
It is not an unprimeable number, because it can be changed into a prime (52894427051) 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, 1029736 + ... + 1079881.
It is an arithmetic number, because the mean of its divisors is an integer number (13224140433).
Almost surely, 252894427041 is an apocalyptic number.
It is an amenable number.
52894427041 is a deficient number, since it is larger than the sum of its proper divisors (2134691).
52894427041 is a wasteful number, since it uses less digits than its factorization.
52894427041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2134690.
The product of its (nonzero) digits is 645120, while the sum is 46.
It can be divided in two parts, 528944 and 27041, that added together give a triangular number (555985 = T1054).
The spelling of 52894427041 in words is "fifty-two billion, eight hundred ninety-four million, four hundred twenty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •