Base | Representation |
---|---|
bin | 10111101101000010100111… |
… | …00001001001000100000001 |
3 | 20211120010001112110012011102 |
4 | 23312201103201021010001 |
5 | 23313004223310113212 |
6 | 302505541310224145 |
7 | 13656626113062623 |
oct | 1366412341110401 |
9 | 224503045405142 |
10 | 52125124301057 |
11 | 15677160850245 |
12 | 5a1a2467b5055 |
13 | 23114bb9a1ac2 |
14 | cc2c25bbac13 |
15 | 605d628ee5c2 |
hex | 2f6853849101 |
52125124301057 has 4 divisors (see below), whose sum is σ = 52125428815296. Its totient is φ = 52124819786820.
The previous prime is 52125124301053. The next prime is 52125124301069. The reversal of 52125124301057 is 75010342152125.
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 52125124301057 - 22 = 52125124301053 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 52125124301057.
It is not an unprimeable number, because it can be changed into a prime (52125124301053) 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, 152000213 + ... + 152342754.
It is an arithmetic number, because the mean of its divisors is an integer number (13031357203824).
Almost surely, 252125124301057 is an apocalyptic number.
It is an amenable number.
52125124301057 is a deficient number, since it is larger than the sum of its proper divisors (304514239).
52125124301057 is a wasteful number, since it uses less digits than its factorization.
52125124301057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304514238.
The product of its (nonzero) digits is 84000, while the sum is 38.
The spelling of 52125124301057 in words is "fifty-two trillion, one hundred twenty-five billion, one hundred twenty-four million, three hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •