Base | Representation |
---|---|
bin | 101101100011010101110… |
… | …011000101011100011101 |
3 | 102002020220121020020021221 |
4 | 231203111303011130131 |
5 | 402241400210131031 |
6 | 10354014532253341 |
7 | 442105216404604 |
oct | 55432563053435 |
9 | 12066817206257 |
10 | 3130323130141 |
11 | aa7620888309 |
12 | 426816a71251 |
13 | 19925a6405ac |
14 | ab719276a3b |
15 | 56660b34a11 |
hex | 2d8d5cc571d |
3130323130141 has 8 divisors (see below), whose sum is σ = 3180111352704. Its totient is φ = 3080693217840.
The previous prime is 3130323130063. The next prime is 3130323130169. The reversal of 3130323130141 is 1410313230313.
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 3130323130141 - 239 = 2580567316253 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 (3130323130541) 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, 39537705 + ... + 39616798.
It is an arithmetic number, because the mean of its divisors is an integer number (397513919088).
Almost surely, 23130323130141 is an apocalyptic number.
It is an amenable number.
3130323130141 is a deficient number, since it is larger than the sum of its proper divisors (49788222563).
3130323130141 is an equidigital number, since it uses as much as digits as its factorization.
3130323130141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79155131.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 3130323130141 its reverse (1410313230313), we get a palindrome (4540636360454).
The spelling of 3130323130141 in words is "three trillion, one hundred thirty billion, three hundred twenty-three million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •