Base | Representation |
---|---|
bin | 100100000111001100001… |
… | …010111101111001011111 |
3 | 22210020111110202220202021 |
4 | 210013030022331321133 |
5 | 311124330104304311 |
6 | 5140012522241011 |
7 | 344201616122434 |
oct | 44071412757137 |
9 | 8706443686667 |
10 | 2481621556831 |
11 | 8774a474497a |
12 | 340b56056167 |
13 | 150028c4a1b1 |
14 | 8817acd3b8b |
15 | 44845401171 |
hex | 241cc2bde5f |
2481621556831 has 8 divisors (see below), whose sum is σ = 2543881731840. Its totient is φ = 2420125310592.
The previous prime is 2481621556811. The next prime is 2481621556849. The reversal of 2481621556831 is 1386551261842.
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 2481621556831 - 219 = 2481621032543 is a prime.
It is a super-2 number, since 2×24816215568312 (a number of 26 digits) contains 22 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 (2481621556801) 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 7 ways as a sum of consecutive naturals, for example, 190975615 + ... + 190988608.
It is an arithmetic number, because the mean of its divisors is an integer number (317985216480).
Almost surely, 22481621556831 is an apocalyptic number.
2481621556831 is a deficient number, since it is larger than the sum of its proper divisors (62260175009).
2481621556831 is an equidigital number, since it uses as much as digits as its factorization.
2481621556831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381964385.
The product of its digits is 2764800, while the sum is 52.
The spelling of 2481621556831 in words is "two trillion, four hundred eighty-one billion, six hundred twenty-one million, five hundred fifty-six thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •