Base | Representation |
---|---|
bin | 111011111011111… |
… | …0100010110000111 |
3 | 12012011021112102010 |
4 | 1313313310112013 |
5 | 13104321333111 |
6 | 531321145303 |
7 | 100560150423 |
oct | 16767642607 |
9 | 5164245363 |
10 | 2011121031 |
11 | 942252aa7 |
12 | 48162b233 |
13 | 26086c25a |
14 | 151151b83 |
15 | bb85caa6 |
hex | 77df4587 |
2011121031 has 8 divisors (see below), whose sum is σ = 2684454784. Its totient is φ = 1339267320.
The previous prime is 2011121009. The next prime is 2011121033. The reversal of 2011121031 is 1301211102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011121031 - 25 = 2011120999 is a prime.
It is a super-2 number, since 2×20111210312 = 8089215602661005922, 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 = 2011120998 and 2011121016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011121033) 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, 366835 + ... + 372276.
It is an arithmetic number, because the mean of its divisors is an integer number (335556848).
Almost surely, 22011121031 is an apocalyptic number.
2011121031 is a deficient number, since it is larger than the sum of its proper divisors (673333753).
2011121031 is an equidigital number, since it uses as much as digits as its factorization.
2011121031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 740021.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 2011121031 is about 44845.5240910395. The cubic root of 2011121031 is about 1262.2520049570.
Adding to 2011121031 its reverse (1301211102), we get a palindrome (3312332133).
The spelling of 2011121031 in words is "two billion, eleven million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •