Base | Representation |
---|---|
bin | 111101011001111… |
… | …010011110101010 |
3 | 2122210111202021000 |
4 | 331121322132222 |
5 | 4102213001211 |
6 | 250120455430 |
7 | 34346404116 |
oct | 7531723652 |
9 | 2583452230 |
10 | 1030203306 |
11 | 489582aa0 |
12 | 24901a576 |
13 | 135583872 |
14 | 9ab70746 |
15 | 6069a656 |
hex | 3d67a7aa |
1030203306 has 32 divisors (see below), whose sum is σ = 2497464000. Its totient is φ = 312182640.
The previous prime is 1030203301. The next prime is 1030203359. The reversal of 1030203306 is 6033020301.
It is a happy number.
It is a super-2 number, since 2×10302033062 = 2122637703386659272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1030203301) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 866581 + ... + 867768.
It is an arithmetic number, because the mean of its divisors is an integer number (78045750).
Almost surely, 21030203306 is an apocalyptic number.
1030203306 is an abundant number, since it is smaller than the sum of its proper divisors (1467260694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030203306 is a wasteful number, since it uses less digits than its factorization.
1030203306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1734371 (or 1734365 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
The square root of 1030203306 is about 32096.7803058188. The cubic root of 1030203306 is about 1009.9680759769.
Adding to 1030203306 its reverse (6033020301), we get a palindrome (7063223607).
The spelling of 1030203306 in words is "one billion, thirty million, two hundred three thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •