Base | Representation |
---|---|
bin | 10111111010000111111000… |
… | …11111000100001011011011 |
3 | 20220011002022202110111001201 |
4 | 23331003330133010023123 |
5 | 23342340323220030201 |
6 | 303452242035455031 |
7 | 14034251325010345 |
oct | 1375037437041333 |
9 | 226132282414051 |
10 | 52574635705051 |
11 | 1582a861268239 |
12 | 5a91397157477 |
13 | 23449c7a8b6a5 |
14 | cda8a9846295 |
15 | 6128c0d28801 |
hex | 2fd0fc7c42db |
52574635705051 has 4 divisors (see below), whose sum is σ = 52574761800504. Its totient is φ = 52574509609600.
The previous prime is 52574635705049. The next prime is 52574635705063. The reversal of 52574635705051 is 15050753647525.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 52574635705051 - 21 = 52574635705049 is a prime.
It is a super-3 number, since 3×525746357050513 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52574635704983 and 52574635705001.
It is not an unprimeable number, because it can be changed into a prime (52574635705091) 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, 62420230 + ... + 63256891.
It is an arithmetic number, because the mean of its divisors is an integer number (13143690450126).
Almost surely, 252574635705051 is an apocalyptic number.
52574635705051 is a deficient number, since it is larger than the sum of its proper divisors (126095453).
52574635705051 is a wasteful number, since it uses less digits than its factorization.
52574635705051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126095452.
The product of its (nonzero) digits is 22050000, while the sum is 55.
The spelling of 52574635705051 in words is "fifty-two trillion, five hundred seventy-four billion, six hundred thirty-five million, seven hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •