Base | Representation |
---|---|
bin | 111101011001100… |
… | …110101101011011 |
3 | 2122210100122011221 |
4 | 331121212231123 |
5 | 4102202403311 |
6 | 250115032511 |
7 | 34345616050 |
oct | 7531465533 |
9 | 2583318157 |
10 | 1030122331 |
11 | 489528177 |
12 | 248b9b737 |
13 | 135555a54 |
14 | 9ab4d027 |
15 | 60681671 |
hex | 3d666b5b |
1030122331 has 8 divisors (see below), whose sum is σ = 1188939744. Its totient is φ = 874219200.
The previous prime is 1030122307. The next prime is 1030122341. The reversal of 1030122331 is 1332210301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030122331 - 215 = 1030089563 is a prime.
It is a super-2 number, since 2×10301223312 = 2122304033649747122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030122341) 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 7 ways as a sum of consecutive naturals, for example, 727810 + ... + 729223.
It is an arithmetic number, because the mean of its divisors is an integer number (148617468).
Almost surely, 21030122331 is an apocalyptic number.
1030122331 is a deficient number, since it is larger than the sum of its proper divisors (158817413).
1030122331 is a wasteful number, since it uses less digits than its factorization.
1030122331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1457141.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1030122331 is about 32095.5188616729. The cubic root of 1030122331 is about 1009.9416137866.
Adding to 1030122331 its reverse (1332210301), we get a palindrome (2362332632).
The spelling of 1030122331 in words is "one billion, thirty million, one hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •