Base | Representation |
---|---|
bin | 10100110000011001001… |
… | …010011101000101001001 |
3 | 12001100122212122012112202 |
4 | 110300121022131011021 |
5 | 141332131414010400 |
6 | 3011131242445545 |
7 | 205023213056066 |
oct | 24603112350511 |
9 | 5040585565482 |
10 | 1426351313225 |
11 | 4aaa04149a03 |
12 | 1b052a2038b5 |
13 | a46730a33c7 |
14 | 4d07022dc6d |
15 | 271817ab4d5 |
hex | 14c1929d149 |
1426351313225 has 12 divisors (see below), whose sum is σ = 1872715371804. Its totient is φ = 1073958635520.
The previous prime is 1426351313143. The next prime is 1426351313243. The reversal of 1426351313225 is 5223131536241.
It can be written as a sum of positive squares in 6 ways, for example, as 104486037049 + 1321865276176 = 323243^2 + 1149724^2 .
It is not a de Polignac number, because 1426351313225 - 220 = 1426350264649 is a prime.
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 11 ways as a sum of consecutive naturals, for example, 1678059944 + ... + 1678060793.
It is an arithmetic number, because the mean of its divisors is an integer number (156059614317).
Almost surely, 21426351313225 is an apocalyptic number.
It is an amenable number.
1426351313225 is a deficient number, since it is larger than the sum of its proper divisors (446364058579).
1426351313225 is a wasteful number, since it uses less digits than its factorization.
1426351313225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3356120764 (or 3356120759 counting only the distinct ones).
The product of its digits is 129600, while the sum is 38.
Adding to 1426351313225 its reverse (5223131536241), we get a palindrome (6649482849466).
The spelling of 1426351313225 in words is "one trillion, four hundred twenty-six billion, three hundred fifty-one million, three hundred thirteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •