Base | Representation |
---|---|
bin | 111101011010000… |
… | …011111011101110 |
3 | 2122210120201101020 |
4 | 331122003323232 |
5 | 4102220221110 |
6 | 250121355010 |
7 | 34346625036 |
oct | 7532037356 |
9 | 2583521336 |
10 | 1030242030 |
11 | 4895aa0a4 |
12 | 249038a66 |
13 | 13559838c |
14 | 9ab808c6 |
15 | 606a6d70 |
hex | 3d683eee |
1030242030 has 16 divisors (see below), whose sum is σ = 2472580944. Its totient is φ = 274731200.
The previous prime is 1030242019. The next prime is 1030242043. The reversal of 1030242030 is 302420301.
It is a super-2 number, since 2×10302420302 = 2122797280757041800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17170671 + ... + 17170730.
It is an arithmetic number, because the mean of its divisors is an integer number (154536309).
Almost surely, 21030242030 is an apocalyptic number.
1030242030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030242030 is an abundant number, since it is smaller than the sum of its proper divisors (1442338914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030242030 is a wasteful number, since it uses less digits than its factorization.
1030242030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34341411.
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 1030242030 is about 32097.3835382263. The cubic root of 1030242030 is about 1009.9807302797.
Adding to 1030242030 its reverse (302420301), we get a palindrome (1332662331).
The spelling of 1030242030 in words is "one billion, thirty million, two hundred forty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •