Base | Representation |
---|---|
bin | 11101101110111111010… |
… | …111101001000011011101 |
3 | 21020100011111021111222200 |
4 | 131232333113221003131 |
5 | 231434204422030300 |
6 | 4202404401202113 |
7 | 300424243242513 |
oct | 35567727510335 |
9 | 7210144244880 |
10 | 2043320111325 |
11 | 718626a2a689 |
12 | 290013930339 |
13 | 11a8b841ac3c |
14 | 70c7bd904b3 |
15 | 382411db200 |
hex | 1dbbf5e90dd |
2043320111325 has 72 divisors (see below), whose sum is σ = 3680174141280. Its totient is φ = 1083721680000.
The previous prime is 2043320111323. The next prime is 2043320111341. The reversal of 2043320111325 is 5231110233402.
2043320111325 is a `hidden beast` number, since 2 + 0 + 4 + 3 + 320 + 1 + 11 + 325 = 666.
It is not a de Polignac number, because 2043320111325 - 21 = 2043320111323 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2043320111321) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 36285291 + ... + 36341559.
It is an arithmetic number, because the mean of its divisors is an integer number (51113529740).
Almost surely, 22043320111325 is an apocalyptic number.
2043320111325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2043320111325 is a deficient number, since it is larger than the sum of its proper divisors (1636854029955).
2043320111325 is a wasteful number, since it uses less digits than its factorization.
2043320111325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57179 (or 57171 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 2043320111325 its reverse (5231110233402), we get a palindrome (7274430344727).
The spelling of 2043320111325 in words is "two trillion, forty-three billion, three hundred twenty million, one hundred eleven thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •