Base | Representation |
---|---|
bin | 100100110101011110000… |
… | …101110110101000100001 |
3 | 22221222202122111100120222 |
4 | 210311132011312220201 |
5 | 312433112432031040 |
6 | 5214511511012425 |
7 | 350611220536526 |
oct | 44653605665041 |
9 | 8858678440528 |
10 | 2531314330145 |
11 | 896584a47a77 |
12 | 34a70406a115 |
13 | 15491815b983 |
14 | 8a7328cd14d |
15 | 45ca2d0abb5 |
hex | 24d5e176a21 |
2531314330145 has 8 divisors (see below), whose sum is σ = 3054359391720. Its totient is φ = 2013863333760.
The previous prime is 2531314330121. The next prime is 2531314330169. The reversal of 2531314330145 is 5410334131352.
It is an interprime number because it is at equal distance from previous prime (2531314330121) and next prime (2531314330169).
It can be written as a sum of positive squares in 4 ways, for example, as 7511862241 + 2523802467904 = 86671^2 + 1588648^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2531314330145 - 214 = 2531314313761 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1398515300 + ... + 1398517109.
It is an arithmetic number, because the mean of its divisors is an integer number (381794923965).
Almost surely, 22531314330145 is an apocalyptic number.
It is an amenable number.
2531314330145 is a deficient number, since it is larger than the sum of its proper divisors (523045061575).
2531314330145 is a wasteful number, since it uses less digits than its factorization.
2531314330145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2797032595.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 2531314330145 its reverse (5410334131352), we get a palindrome (7941648461497).
The spelling of 2531314330145 in words is "two trillion, five hundred thirty-one billion, three hundred fourteen million, three hundred thirty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •