Base | Representation |
---|---|
bin | 1100011000000111100… |
… | …11111100100100010000 |
3 | 1111122200111110111021211 |
4 | 12030003303330210100 |
5 | 23431421010231001 |
6 | 523210412025504 |
7 | 42503323622062 |
oct | 6140363744420 |
9 | 1448614414254 |
10 | 425265711376 |
11 | 154399453300 |
12 | 6a504762294 |
13 | 31143c2860c |
14 | 16823955732 |
15 | b0deaa5351 |
hex | 6303cfc910 |
425265711376 has 45 divisors (see below), whose sum is σ = 905727706149. Its totient is φ = 193289553600.
The previous prime is 425265711331. The next prime is 425265711383. The reversal of 425265711376 is 673117562524.
The square root of 425265711376 is 652124.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 186731151376 + 238534560000 = 432124^2 + 488400^2 .
It is a Duffinian number.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 28686046 + ... + 28700866.
Almost surely, 2425265711376 is an apocalyptic number.
425265711376 is the 652124-th square number.
It is an amenable number.
425265711376 is an abundant number, since it is smaller than the sum of its proper divisors (480461994773).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425265711376 is an frugal number, since it uses more digits than its factorization.
425265711376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29672 (or 14834 counting only the distinct ones).
The product of its digits is 2116800, while the sum is 49.
Multiplying 425265711376 by its sum of digits (49), we get a square (20838019857424 = 45648682).
The spelling of 425265711376 in words is "four hundred twenty-five billion, two hundred sixty-five million, seven hundred eleven thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •