Base | Representation |
---|---|
bin | 11110100101000010000… |
… | …000111011000011000101 |
3 | 21102212221110020210212201 |
4 | 132211002000323003011 |
5 | 233412024203431421 |
6 | 4245202325114501 |
7 | 304550216634163 |
oct | 36450200730305 |
9 | 7385843223781 |
10 | 2101346545861 |
11 | 7401a3385802 |
12 | 29b308858a31 |
13 | 123205027bc4 |
14 | 739c46aa233 |
15 | 399da54db91 |
hex | 1e94203b0c5 |
2101346545861 has 8 divisors (see below), whose sum is σ = 2103247093248. Its totient is φ = 2099446206000.
The previous prime is 2101346545813. The next prime is 2101346545873. The reversal of 2101346545861 is 1685456431012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2101346545861 - 219 = 2101346021573 is a prime.
It is a super-3 number, since 3×21013465458613 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101346245861) 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, 26072856 + ... + 26153326.
It is an arithmetic number, because the mean of its divisors is an integer number (262905886656).
Almost surely, 22101346545861 is an apocalyptic number.
It is an amenable number.
2101346545861 is a deficient number, since it is larger than the sum of its proper divisors (1900547387).
2101346545861 is a wasteful number, since it uses less digits than its factorization.
2101346545861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103763.
The product of its (nonzero) digits is 691200, while the sum is 46.
The spelling of 2101346545861 in words is "two trillion, one hundred one billion, three hundred forty-six million, five hundred forty-five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •