Base | Representation |
---|---|
bin | 111101011010110… |
… | …010100101011111 |
3 | 2122210221102111121 |
4 | 331122302211133 |
5 | 4102242324434 |
6 | 250125431411 |
7 | 34351352122 |
oct | 7532624537 |
9 | 2583842447 |
10 | 1030433119 |
11 | 48971a721 |
12 | 24910b567 |
13 | 135634351 |
14 | 9abd03b9 |
15 | 606e37b4 |
hex | 3d6b295f |
1030433119 has 4 divisors (see below), whose sum is σ = 1031320296. Its totient is φ = 1029545944.
The previous prime is 1030433113. The next prime is 1030433141. The reversal of 1030433119 is 9113340301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1030433119 - 217 = 1030302047 is a prime.
It is a super-2 number, since 2×10304331192 = 2123584825464136322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030433093 and 1030433102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030433113) 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 3 ways as a sum of consecutive naturals, for example, 441844 + ... + 444169.
It is an arithmetic number, because the mean of its divisors is an integer number (257830074).
Almost surely, 21030433119 is an apocalyptic number.
1030433119 is a deficient number, since it is larger than the sum of its proper divisors (887177).
1030433119 is an equidigital number, since it uses as much as digits as its factorization.
1030433119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 887176.
The product of its (nonzero) digits is 972, while the sum is 25.
The square root of 1030433119 is about 32100.3601070144. The cubic root of 1030433119 is about 1010.0431700660.
The spelling of 1030433119 in words is "one billion, thirty million, four hundred thirty-three thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •