Base | Representation |
---|---|
bin | 111101011010011… |
… | …110111000101001 |
3 | 2122210210022210221 |
4 | 331122132320221 |
5 | 4102232234200 |
6 | 250124010041 |
7 | 34350564634 |
oct | 7532367051 |
9 | 2583708727 |
10 | 1030352425 |
11 | 489675033 |
12 | 249090921 |
13 | 1356066bb |
14 | 9abacc1b |
15 | 606c991a |
hex | 3d69ee29 |
1030352425 has 48 divisors (see below), whose sum is σ = 1399910400. Its totient is φ = 749390400.
The previous prime is 1030352423. The next prime is 1030352429. The reversal of 1030352425 is 5242530301.
It is not a de Polignac number, because 1030352425 - 21 = 1030352423 is a prime.
It is a super-2 number, since 2×10303524252 = 2123252239406761250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 1030352425.
It is not an unprimeable number, because it can be changed into a prime (1030352423) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2458866 + ... + 2459284.
It is an arithmetic number, because the mean of its divisors is an integer number (29164800).
Almost surely, 21030352425 is an apocalyptic number.
It is an amenable number.
1030352425 is a deficient number, since it is larger than the sum of its proper divisors (369557975).
1030352425 is a wasteful number, since it uses less digits than its factorization.
1030352425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 646 (or 641 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 1030352425 is about 32099.1031806186. The cubic root of 1030352425 is about 1010.0168036285.
Adding to 1030352425 its reverse (5242530301), we get a palindrome (6272882726).
The spelling of 1030352425 in words is "one billion, thirty million, three hundred fifty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •