Base | Representation |
---|---|
bin | 111011101000110… |
… | …1011000000011111 |
3 | 12011110110111101010 |
4 | 1313101223000133 |
5 | 13044241340221 |
6 | 530322550303 |
7 | 100406151630 |
oct | 16721530037 |
9 | 5143414333 |
10 | 2001121311 |
11 | 937643072 |
12 | 47a208393 |
13 | 25b77a867 |
14 | 14daab887 |
15 | baa34c76 |
hex | 7746b01f |
2001121311 has 8 divisors (see below), whose sum is σ = 3049327744. Its totient is φ = 1143497880.
The previous prime is 2001121261. The next prime is 2001121313. The reversal of 2001121311 is 1131211002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001121311 - 214 = 2001104927 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001121313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47645725 + ... + 47645766.
It is an arithmetic number, because the mean of its divisors is an integer number (381165968).
Almost surely, 22001121311 is an apocalyptic number.
2001121311 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2001121311 is a deficient number, since it is larger than the sum of its proper divisors (1048206433).
2001121311 is an equidigital number, since it uses as much as digits as its factorization.
2001121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95291501.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 2001121311 is about 44733.8944314040. The cubic root of 2001121311 is about 1260.1564664599.
Adding to 2001121311 its reverse (1131211002), we get a palindrome (3132332313).
The spelling of 2001121311 in words is "two billion, one million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •