Base | Representation |
---|---|
bin | 100100110101001011010… |
… | …110110010011001011111 |
3 | 22221221221202000211122010 |
4 | 210311023112302121133 |
5 | 312431442000032033 |
6 | 5214420401522303 |
7 | 350600353023414 |
oct | 44651326623137 |
9 | 8857852024563 |
10 | 2531000002143 |
11 | 896433577768 |
12 | 34a636943393 |
13 | 154897cb5382 |
14 | 8a702c6a10b |
15 | 45c8541b863 |
hex | 24d4b5b265f |
2531000002143 has 8 divisors (see below), whose sum is σ = 3374766174256. Its totient is φ = 1687283582400.
The previous prime is 2531000002133. The next prime is 2531000002171. The reversal of 2531000002143 is 3412000001352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2531000002143 - 24 = 2531000002127 is a prime.
It is a super-2 number, since 2×25310000021432 (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 (2531000002133) 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, 12319228 + ... + 12522993.
It is an arithmetic number, because the mean of its divisors is an integer number (421845771782).
Almost surely, 22531000002143 is an apocalyptic number.
2531000002143 is a deficient number, since it is larger than the sum of its proper divisors (843766172113).
2531000002143 is a wasteful number, since it uses less digits than its factorization.
2531000002143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24876185.
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 2531000002143 its reverse (3412000001352), we get a palindrome (5943000003495).
The spelling of 2531000002143 in words is "two trillion, five hundred thirty-one billion, two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •