Base | Representation |
---|---|
bin | 100100110101001100100… |
… | …111000000111010110111 |
3 | 22221222000012121022202001 |
4 | 210311030213000322313 |
5 | 312432012341030033 |
6 | 5214422432400131 |
7 | 350601026545321 |
oct | 44651447007267 |
9 | 8858005538661 |
10 | 2531021033143 |
11 | 896444431659 |
12 | 34a6419a6047 |
13 | 15489c469b55 |
14 | 8a705982611 |
15 | 45c871c2e7d |
hex | 24d4c9c0eb7 |
2531021033143 has 4 divisors (see below), whose sum is σ = 2534897023128. Its totient is φ = 2527145043160.
The previous prime is 2531021033131. The next prime is 2531021033147. The reversal of 2531021033143 is 3413301201352.
2531021033143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2531021033143 - 217 = 2531020902071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2531021033147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1937994013 + ... + 1937995318.
It is an arithmetic number, because the mean of its divisors is an integer number (633724255782).
Almost surely, 22531021033143 is an apocalyptic number.
2531021033143 is a deficient number, since it is larger than the sum of its proper divisors (3875989985).
2531021033143 is an equidigital number, since it uses as much as digits as its factorization.
2531021033143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3875989984.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 2531021033143 its reverse (3413301201352), we get a palindrome (5944322234495).
The spelling of 2531021033143 in words is "two trillion, five hundred thirty-one billion, twenty-one million, thirty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •