Base | Representation |
---|---|
bin | 11001010110011… |
… | …100010011111011 |
3 | 1002122022011111000 |
4 | 121112130103323 |
5 | 1332340013111 |
6 | 110111540043 |
7 | 13353051066 |
oct | 3126342373 |
9 | 1078264430 |
10 | 425313531 |
11 | 1a9095395 |
12 | ba52a623 |
13 | 6a165416 |
14 | 406b38dd |
15 | 27513c56 |
hex | 1959c4fb |
425313531 has 32 divisors (see below), whose sum is σ = 673358400. Its totient is φ = 264384000.
The previous prime is 425313523. The next prime is 425313571. The reversal of 425313531 is 135313524.
It is not a de Polignac number, because 425313531 - 23 = 425313523 is a prime.
It is a super-3 number, since 3×4253135313 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 425313495 and 425313504.
It is not an unprimeable number, because it can be changed into a prime (425313571) 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 31 ways as a sum of consecutive naturals, for example, 45781 + ... + 54281.
It is an arithmetic number, because the mean of its divisors is an integer number (21042450).
Almost surely, 2425313531 is an apocalyptic number.
425313531 is a deficient number, since it is larger than the sum of its proper divisors (248044869).
425313531 is a wasteful number, since it uses less digits than its factorization.
425313531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8636 (or 8630 counting only the distinct ones).
The product of its digits is 5400, while the sum is 27.
The square root of 425313531 is about 20623.1309698600. The cubic root of 425313531 is about 752.0321369198.
The spelling of 425313531 in words is "four hundred twenty-five million, three hundred thirteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •