Base | Representation |
---|---|
bin | 111100110011000… |
… | …100100110001011 |
3 | 2122002100102221102 |
4 | 330303010212023 |
5 | 4042111134011 |
6 | 245114332015 |
7 | 34164015353 |
oct | 7463044613 |
9 | 2562312842 |
10 | 1020021131 |
11 | 483858a78 |
12 | 24572a00b |
13 | 13342a0cc |
14 | 9967db63 |
15 | 5e83873b |
hex | 3ccc498b |
1020021131 has 8 divisors (see below), whose sum is σ = 1082524464. Its totient is φ = 957795840.
The previous prime is 1020021127. The next prime is 1020021133. The reversal of 1020021131 is 1311200201.
1020021131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1020021131 - 22 = 1020021127 is a prime.
It is a super-2 number, since 2×10200211312 = 2080886215373038322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020021133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61925 + ... + 76646.
It is an arithmetic number, because the mean of its divisors is an integer number (135315558).
Almost surely, 21020021131 is an apocalyptic number.
1020021131 is a deficient number, since it is larger than the sum of its proper divisors (62503333).
1020021131 is a wasteful number, since it uses less digits than its factorization.
1020021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139021.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1020021131 is about 31937.7696622666. The cubic root of 1020021131 is about 1006.6296608012.
Adding to 1020021131 its reverse (1311200201), we get a palindrome (2331221332).
The spelling of 1020021131 in words is "one billion, twenty million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •