Base | Representation |
---|---|
bin | 11101010001001110100… |
… | …101000110111111001101 |
3 | 21010021200100102100202122 |
4 | 131101032211012333031 |
5 | 230423232414422300 |
6 | 4140001334302325 |
7 | 265213310540054 |
oct | 35211645067715 |
9 | 7107610370678 |
10 | 2011363045325 |
11 | 706018003a37 |
12 | 2859954b79a5 |
13 | 11789476192a |
14 | 6d4c9a6539b |
15 | 374c0880c85 |
hex | 1d44e946fcd |
2011363045325 has 24 divisors (see below), whose sum is σ = 2553289430208. Its totient is φ = 1570932478080.
The previous prime is 2011363045217. The next prime is 2011363045333. The reversal of 2011363045325 is 5235403631102.
It is a happy number.
It is not a de Polignac number, because 2011363045325 - 216 = 2011362979789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1859504 + ... + 2735046.
It is an arithmetic number, because the mean of its divisors is an integer number (106387059592).
Almost surely, 22011363045325 is an apocalyptic number.
2011363045325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2011363045325 is a deficient number, since it is larger than the sum of its proper divisors (541926384883).
2011363045325 is a wasteful number, since it uses less digits than its factorization.
2011363045325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877733 (or 877728 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 2011363045325 its reverse (5235403631102), we get a palindrome (7246766676427).
The spelling of 2011363045325 in words is "two trillion, eleven billion, three hundred sixty-three million, forty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •