Base | Representation |
---|---|
bin | 11101010001011001111… |
… | …001111011001100010101 |
3 | 21010022011120221200010011 |
4 | 131101121321323030111 |
5 | 230424130040121123 |
6 | 4140032243000221 |
7 | 265221105551503 |
oct | 35213171731425 |
9 | 7108146850104 |
10 | 2011553051413 |
11 | 706105290364 |
12 | 285a29069071 |
13 | 1178c4c2a079 |
14 | 6d506da5673 |
15 | 374d23b3e0d |
hex | 1d459e7b315 |
2011553051413 has 4 divisors (see below), whose sum is σ = 2013699853900. Its totient is φ = 2009406248928.
The previous prime is 2011553051407. The next prime is 2011553051447. The reversal of 2011553051413 is 3141503551102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 228214487524 + 1783338563889 = 477718^2 + 1335417^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011553051413 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 (2011553052413) by changing a digit.
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, 1073399838 + ... + 1073401711.
It is an arithmetic number, because the mean of its divisors is an integer number (503424963475).
Almost surely, 22011553051413 is an apocalyptic number.
It is an amenable number.
2011553051413 is a deficient number, since it is larger than the sum of its proper divisors (2146802487).
2011553051413 is an equidigital number, since it uses as much as digits as its factorization.
2011553051413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2146802486.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 2011553051413 in words is "two trillion, eleven billion, five hundred fifty-three million, fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •