Base | Representation |
---|---|
bin | 10111110000101101101011… |
… | …00110111111001011101101 |
3 | 20212000011210121112210101202 |
4 | 23320112311212333023231 |
5 | 23322041202424132310 |
6 | 303043532113015245 |
7 | 14002014343213355 |
oct | 1370266546771355 |
9 | 225004717483352 |
10 | 52251324052205 |
11 | 15715731269143 |
12 | 5a3a7a6854525 |
13 | 2320381452b75 |
14 | cc8d9868bb65 |
15 | 60929bce83a5 |
hex | 2f85b59bf2ed |
52251324052205 has 4 divisors (see below), whose sum is σ = 62701588862652. Its totient is φ = 41801059241760.
The previous prime is 52251324052171. The next prime is 52251324052271. The reversal of 52251324052205 is 50225042315225.
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 9644869373161 + 42606454679044 = 3105619^2 + 6527362^2 .
It is not a de Polignac number, because 52251324052205 - 224 = 52251307274989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5225132405216 + ... + 5225132405225.
It is an arithmetic number, because the mean of its divisors is an integer number (15675397215663).
Almost surely, 252251324052205 is an apocalyptic number.
It is an amenable number.
52251324052205 is a deficient number, since it is larger than the sum of its proper divisors (10450264810447).
52251324052205 is a wasteful number, since it uses less digits than its factorization.
52251324052205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10450264810446.
The product of its (nonzero) digits is 240000, while the sum is 38.
The spelling of 52251324052205 in words is "fifty-two trillion, two hundred fifty-one billion, three hundred twenty-four million, fifty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •