Base | Representation |
---|---|
bin | 110000111001100011… |
… | …101000111001100001 |
3 | 12000112011220010111200 |
4 | 300321203220321201 |
5 | 1330012321021200 |
6 | 40042013431413 |
7 | 3536062162524 |
oct | 607143507141 |
9 | 160464803450 |
10 | 52505251425 |
11 | 202a3933580 |
12 | a213a9b569 |
13 | 4c49aba513 |
14 | 278134abbb |
15 | 15747ab800 |
hex | c398e8e61 |
52505251425 has 72 divisors (see below), whose sum is σ = 102923466048. Its totient is φ = 25374864000.
The previous prime is 52505251411. The next prime is 52505251427. The reversal of 52505251425 is 52415250525.
52505251425 is a `hidden beast` number, since 5 + 2 + 505 + 2 + 5 + 142 + 5 = 666.
It is not a de Polignac number, because 52505251425 - 213 = 52505243233 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52505251425.
It is not an unprimeable number, because it can be changed into a prime (52505251427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 735619 + ... + 803831.
It is an arithmetic number, because the mean of its divisors is an integer number (1429492584).
Almost surely, 252505251425 is an apocalyptic number.
52505251425 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52505251425 is a deficient number, since it is larger than the sum of its proper divisors (50418214623).
52505251425 is a wasteful number, since it uses less digits than its factorization.
52505251425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68551 (or 68543 counting only the distinct ones).
The product of its (nonzero) digits is 100000, while the sum is 36.
The spelling of 52505251425 in words is "fifty-two billion, five hundred five million, two hundred fifty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •