Base | Representation |
---|---|
bin | 1001011011011110… |
… | …0010001011101011 |
3 | 20112101210020210012 |
4 | 2112313202023223 |
5 | 20140432442311 |
6 | 1055055042135 |
7 | 116503223606 |
oct | 22667421353 |
9 | 6471706705 |
10 | 2531140331 |
11 | 1089843215 |
12 | 5a781034b |
13 | 314513495 |
14 | 1a023933d |
15 | ec32c78b |
hex | 96de22eb |
2531140331 has 8 divisors (see below), whose sum is σ = 2576772000. Its totient is φ = 2485890880.
The previous prime is 2531140307. The next prime is 2531140351. The reversal of 2531140331 is 1330411352.
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 2531140331 - 26 = 2531140267 is a prime.
It is a super-2 number, since 2×25311403312 = 12813342750429579122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2531140297 and 2531140306.
It is not an unprimeable number, because it can be changed into a prime (2531140301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82175 + ... + 108696.
It is an arithmetic number, because the mean of its divisors is an integer number (322096500).
Almost surely, 22531140331 is an apocalyptic number.
2531140331 is a deficient number, since it is larger than the sum of its proper divisors (45631669).
2531140331 is a wasteful number, since it uses less digits than its factorization.
2531140331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191109.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 2531140331 is about 50310.4395826552. The cubic root of 2531140331 is about 1362.8207621869.
Adding to 2531140331 its reverse (1330411352), we get a palindrome (3861551683).
The spelling of 2531140331 in words is "two billion, five hundred thirty-one million, one hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •