Base | Representation |
---|---|
bin | 11101010001110000101… |
… | …010100110001110001001 |
3 | 21010100011012111001200122 |
4 | 131101300222212032021 |
5 | 230430420314044241 |
6 | 4140134203313025 |
7 | 265233423363041 |
oct | 35216052461611 |
9 | 7110135431618 |
10 | 2011934909321 |
11 | 706290894907 |
12 | 285b14b1b775 |
13 | 117956088aac |
14 | 6d5419a6721 |
15 | 37505b9204b |
hex | 1d470aa6389 |
2011934909321 has 6 divisors (see below), whose sum is σ = 2137245734430. Its totient is φ = 1893585796736.
The previous prime is 2011934909293. The next prime is 2011934909353. The reversal of 2011934909321 is 1239094391102.
It can be written as a sum of positive squares in 3 ways, for example, as 1521670273600 + 490264635721 = 1233560^2 + 700189^2 .
It is a de Polignac number, because none of the positive numbers 2k-2011934909321 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2011934909821) 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 5 ways as a sum of consecutive naturals, for example, 3480855956 + ... + 3480856533.
It is an arithmetic number, because the mean of its divisors is an integer number (356207622405).
Almost surely, 22011934909321 is an apocalyptic number.
It is an amenable number.
2011934909321 is a deficient number, since it is larger than the sum of its proper divisors (125310825109).
2011934909321 is an equidigital number, since it uses as much as digits as its factorization.
2011934909321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6961712523 (or 6961712506 counting only the distinct ones).
The product of its (nonzero) digits is 104976, while the sum is 44.
The spelling of 2011934909321 in words is "two trillion, eleven billion, nine hundred thirty-four million, nine hundred nine thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •