Base | Representation |
---|---|
bin | 111101011001100… |
… | …110011101010111 |
3 | 2122210100120202212 |
4 | 331121212131113 |
5 | 4102202340203 |
6 | 250115024035 |
7 | 34345613051 |
oct | 7531463527 |
9 | 2583316685 |
10 | 1030121303 |
11 | 489527422 |
12 | 248b9b01b |
13 | 135555443 |
14 | 9ab4c8d1 |
15 | 606811d8 |
hex | 3d666757 |
1030121303 has 4 divisors (see below), whose sum is σ = 1049557608. Its totient is φ = 1010685000.
The previous prime is 1030121291. The next prime is 1030121357. The reversal of 1030121303 is 3031210301.
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 1030121303 - 226 = 963012439 is a prime.
It is a super-2 number, since 2×10301213032 = 2122299797788835618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030121363) 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, 9718073 + ... + 9718178.
It is an arithmetic number, because the mean of its divisors is an integer number (262389402).
Almost surely, 21030121303 is an apocalyptic number.
1030121303 is a deficient number, since it is larger than the sum of its proper divisors (19436305).
1030121303 is an equidigital number, since it uses as much as digits as its factorization.
1030121303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19436304.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 1030121303 is about 32095.5028469722. The cubic root of 1030121303 is about 1009.9412778329.
Adding to 1030121303 its reverse (3031210301), we get a palindrome (4061331604).
The spelling of 1030121303 in words is "one billion, thirty million, one hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •