Base | Representation |
---|---|
bin | 100101000001100101011… |
… | …010111100101000010101 |
3 | 100000020100012002201101120 |
4 | 211001211122330220111 |
5 | 313141232440432013 |
6 | 5224502342514153 |
7 | 351551450611545 |
oct | 45014532745025 |
9 | 10006305081346 |
10 | 2544322202133 |
11 | 8a104a6097a8 |
12 | 351134435959 |
13 | 155c0c05874a |
14 | 8b208307325 |
15 | 462b4cb5123 |
hex | 250656bca15 |
2544322202133 has 16 divisors (see below), whose sum is σ = 3464713297920. Its totient is φ = 1660075127856.
The previous prime is 2544322202119. The next prime is 2544322202141. The reversal of 2544322202133 is 3312022234452.
It is not a de Polignac number, because 2544322202133 - 28 = 2544322201877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2544322202094 and 2544322202103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2544322202183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4755348 + ... + 5263266.
It is an arithmetic number, because the mean of its divisors is an integer number (216544581120).
Almost surely, 22544322202133 is an apocalyptic number.
It is an amenable number.
2544322202133 is a deficient number, since it is larger than the sum of its proper divisors (920391095787).
2544322202133 is a wasteful number, since it uses less digits than its factorization.
2544322202133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543496.
The product of its (nonzero) digits is 69120, while the sum is 33.
Adding to 2544322202133 its reverse (3312022234452), we get a palindrome (5856344436585).
The spelling of 2544322202133 in words is "two trillion, five hundred forty-four billion, three hundred twenty-two million, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •