Base | Representation |
---|---|
bin | 110001000111001100… |
… | …011010011001001101 |
3 | 12001010010101222112120 |
4 | 301013030122121031 |
5 | 1330444403344400 |
6 | 40120425323153 |
7 | 3544540655466 |
oct | 610714323115 |
9 | 161103358476 |
10 | 52734043725 |
11 | 20400aa1620 |
12 | a2786364b9 |
13 | 4c85315b8c |
14 | 27a38a5d6d |
15 | 1589901ca0 |
hex | c4731a64d |
52734043725 has 48 divisors (see below), whose sum is σ = 97683718080. Its totient is φ = 24876979200.
The previous prime is 52734043723. The next prime is 52734043727.
52734043725 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (52734043723) and next prime (52734043727).
It is not a de Polignac number, because 52734043725 - 21 = 52734043723 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52734043723) 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 47 ways as a sum of consecutive naturals, for example, 833260 + ... + 894309.
It is an arithmetic number, because the mean of its divisors is an integer number (2035077460).
Almost surely, 252734043725 is an apocalyptic number.
52734043725 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52734043725 is a deficient number, since it is larger than the sum of its proper divisors (44949674355).
52734043725 is a wasteful number, since it uses less digits than its factorization.
52734043725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1727630 (or 1727625 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 42.
The spelling of 52734043725 in words is "fifty-two billion, seven hundred thirty-four million, forty-three thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •