Base | Representation |
---|---|
bin | 11001010110011… |
… | …010111111100010 |
3 | 1002122021220001222 |
4 | 121112122333202 |
5 | 1332334330010 |
6 | 110111455042 |
7 | 13353026252 |
oct | 3126327742 |
9 | 1078256058 |
10 | 425308130 |
11 | 1a9091325 |
12 | ba527482 |
13 | 6a162b20 |
14 | 406b1962 |
15 | 27512355 |
hex | 1959afe2 |
425308130 has 16 divisors (see below), whose sum is σ = 824443704. Its totient is φ = 157036800.
The previous prime is 425308109. The next prime is 425308139. The reversal of 425308130 is 31803524.
It is a Cunningham number, because it is equal to 206232+1.
It can be written as a sum of positive squares in 4 ways, for example, as 315666289 + 109641841 = 17767^2 + 10471^2 .
It is a super-3 number, since 3×4253081303 (a number of 27 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 425308130.
It is not an unprimeable number, because it can be changed into a prime (425308139) 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 7 ways as a sum of consecutive naturals, for example, 1635671 + ... + 1635930.
Almost surely, 2425308130 is an apocalyptic number.
425308130 is a deficient number, since it is larger than the sum of its proper divisors (399135574).
425308130 is a wasteful number, since it uses less digits than its factorization.
425308130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3271621.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 425308130 is about 20623.0000242448. Note that the first 4 decimals coincide. The cubic root of 425308130 is about 752.0289535876.
The spelling of 425308130 in words is "four hundred twenty-five million, three hundred eight thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •