Base | Representation |
---|---|
bin | 111100000110101001001… |
… | …100101010101000011111 |
3 | 112121212000212100101200121 |
4 | 330012221030222220133 |
5 | 1020132324333210221 |
6 | 12441233515135411 |
7 | 604255511533351 |
oct | 74065114525037 |
9 | 15555025311617 |
10 | 4130302241311 |
11 | 1352718a36104 |
12 | 568591a44567 |
13 | 23c6414a427c |
14 | 103c9ca030d1 |
15 | 7268a621a41 |
hex | 3c1a932aa1f |
4130302241311 has 8 divisors (see below), whose sum is σ = 4133132771040. Its totient is φ = 4127471947008.
The previous prime is 4130302241287. The next prime is 4130302241321. The reversal of 4130302241311 is 1131422030314.
4130302241311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4130302241311 - 217 = 4130302110239 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 (4130302241321) 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, 48562455 + ... + 48647431.
It is an arithmetic number, because the mean of its divisors is an integer number (516641596380).
Almost surely, 24130302241311 is an apocalyptic number.
4130302241311 is a deficient number, since it is larger than the sum of its proper divisors (2830529729).
4130302241311 is a wasteful number, since it uses less digits than its factorization.
4130302241311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117713.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 4130302241311 its reverse (1131422030314), we get a palindrome (5261724271625).
The spelling of 4130302241311 in words is "four trillion, one hundred thirty billion, three hundred two million, two hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •