Base | Representation |
---|---|
bin | 11101001100101110010… |
… | …100001001100101111111 |
3 | 21002211012022002200100200 |
4 | 131030232110021211333 |
5 | 230333331322330333 |
6 | 4133441412054543 |
7 | 264652414026546 |
oct | 35145624114577 |
9 | 7084168080320 |
10 | 2006526761343 |
11 | 703a66057225 |
12 | 284a65904453 |
13 | 1172a37c5030 |
14 | 6d18b61d15d |
15 | 372daeb7c13 |
hex | 1d32e50997f |
2006526761343 has 48 divisors (see below), whose sum is σ = 3159566067840. Its totient is φ = 1219639747392.
The previous prime is 2006526761321. The next prime is 2006526761359. The reversal of 2006526761343 is 3431676256002.
2006526761343 is a `hidden beast` number, since 2 + 0 + 0 + 6 + 5 + 26 + 7 + 613 + 4 + 3 = 666.
It is not a de Polignac number, because 2006526761343 - 29 = 2006526760831 is a prime.
It is a super-2 number, since 2×20065267613432 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2006526761143) 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 47 ways as a sum of consecutive naturals, for example, 49573848 + ... + 49614306.
It is an arithmetic number, because the mean of its divisors is an integer number (65824293080).
Almost surely, 22006526761343 is an apocalyptic number.
2006526761343 is a deficient number, since it is larger than the sum of its proper divisors (1153039306497).
2006526761343 is a wasteful number, since it uses less digits than its factorization.
2006526761343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45668 (or 45665 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 45.
The spelling of 2006526761343 in words is "two trillion, six billion, five hundred twenty-six million, seven hundred sixty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •