Base | Representation |
---|---|
bin | 111101110110110011100… |
… | …110010010010110001001 |
3 | 120001100220002100210010201 |
4 | 331312303212102112021 |
5 | 1024121001332022100 |
6 | 13012432220412201 |
7 | 616051124156221 |
oct | 75666346222611 |
9 | 16040802323121 |
10 | 4250735814025 |
11 | 13997aa606888 |
12 | 5879a29a7061 |
13 | 24aac545612c |
14 | 109a4576d081 |
15 | 758886bd36a |
hex | 3ddb3992589 |
4250735814025 has 6 divisors (see below), whose sum is σ = 5270912409422. Its totient is φ = 3400588651200.
The previous prime is 4250735814023. The next prime is 4250735814113. The reversal of 4250735814025 is 5204185370524.
It can be written as a sum of positive squares in 3 ways, for example, as 185233830544 + 4065501983481 = 430388^2 + 2016309^2 .
It is not a de Polignac number, because 4250735814025 - 21 = 4250735814023 is a prime.
It is a super-4 number, since 4×42507358140254 (a number of 52 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4250735814023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 85014716256 + ... + 85014716305.
Almost surely, 24250735814025 is an apocalyptic number.
It is an amenable number.
4250735814025 is a deficient number, since it is larger than the sum of its proper divisors (1020176595397).
4250735814025 is a wasteful number, since it uses less digits than its factorization.
4250735814025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170029432571 (or 170029432566 counting only the distinct ones).
The product of its (nonzero) digits is 1344000, while the sum is 46.
The spelling of 4250735814025 in words is "four trillion, two hundred fifty billion, seven hundred thirty-five million, eight hundred fourteen thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •