Base | Representation |
---|---|
bin | 111011111100011… |
… | …1110010100001011 |
3 | 12012011211221000121 |
4 | 1313320332110023 |
5 | 13104411032021 |
6 | 531331444111 |
7 | 100562551642 |
oct | 16770762413 |
9 | 5164757017 |
10 | 2011424011 |
11 | 94243a6a3 |
12 | 481756637 |
13 | 26094712c |
14 | 1511d0359 |
15 | bb8bc741 |
hex | 77e3e50b |
2011424011 has 4 divisors (see below), whose sum is σ = 2012148000. Its totient is φ = 2010700024.
The previous prime is 2011423957. The next prime is 2011424033. The reversal of 2011424011 is 1104241102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1104241102 = 2 ⋅552120551.
It is a cyclic number.
It is not a de Polignac number, because 2011424011 - 221 = 2009326859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011424111) 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 3 ways as a sum of consecutive naturals, for example, 357811 + ... + 363388.
It is an arithmetic number, because the mean of its divisors is an integer number (503037000).
Almost surely, 22011424011 is an apocalyptic number.
2011424011 is a deficient number, since it is larger than the sum of its proper divisors (723989).
2011424011 is an equidigital number, since it uses as much as digits as its factorization.
2011424011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723988.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 2011424011 is about 44848.9020043969. The cubic root of 2011424011 is about 1262.3153888282.
Adding to 2011424011 its reverse (1104241102), we get a palindrome (3115665113).
The spelling of 2011424011 in words is "two billion, eleven million, four hundred twenty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •