Base | Representation |
---|---|
bin | 111011111011101… |
… | …1011111011100110 |
3 | 12012011002110020101 |
4 | 1313313123323212 |
5 | 13104310133110 |
6 | 531315054314 |
7 | 100556253034 |
oct | 16767337346 |
9 | 5164073211 |
10 | 2011021030 |
11 | 942194957 |
12 | 4815a139a |
13 | 260835895 |
14 | 151127554 |
15 | bb83d13a |
hex | 77ddbee6 |
2011021030 has 8 divisors (see below), whose sum is σ = 3619837872. Its totient is φ = 804408408.
The previous prime is 2011020989. The next prime is 2011021043. The reversal of 2011021030 is 301201102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 201102103 = 2011021030 / (2 + 0 + 1 + 1 + 0 + 2 + 1 + 0 + 3 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 2011020998 and 2011021016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100551042 + ... + 100551061.
It is an arithmetic number, because the mean of its divisors is an integer number (452479734).
Almost surely, 22011021030 is an apocalyptic number.
2011021030 is a deficient number, since it is larger than the sum of its proper divisors (1608816842).
2011021030 is a wasteful number, since it uses less digits than its factorization.
2011021030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201102110.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 2011021030 is about 44844.4091275601. The cubic root of 2011021030 is about 1262.2310832003.
Adding to 2011021030 its reverse (301201102), we get a palindrome (2312222132).
The spelling of 2011021030 in words is "two billion, eleven million, twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •