Base | Representation |
---|---|
bin | 100011010111001111101… |
… | …001100100001010111011 |
3 | 22121022121122201012111210 |
4 | 203113033221210022323 |
5 | 304303411404131021 |
6 | 5100220244254203 |
7 | 340400066513502 |
oct | 43271751441273 |
9 | 8538548635453 |
10 | 2430140302011 |
11 | 857686935194 |
12 | 332b890a1363 |
13 | 14821334c436 |
14 | 8589597d839 |
15 | 433309b5e76 |
hex | 235cfa642bb |
2430140302011 has 8 divisors (see below), whose sum is σ = 3244444874064. Its totient is φ = 1617964632320.
The previous prime is 2430140301973. The next prime is 2430140302019. The reversal of 2430140302011 is 1102030410342.
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 2430140302011 - 26 = 2430140301947 is a prime.
It is a super-2 number, since 2×24301403020112 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2430140302019) 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, 532222926 + ... + 532227491.
It is an arithmetic number, because the mean of its divisors is an integer number (405555609258).
Almost surely, 22430140302011 is an apocalyptic number.
2430140302011 is a deficient number, since it is larger than the sum of its proper divisors (814304572053).
2430140302011 is a wasteful number, since it uses less digits than its factorization.
2430140302011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064451181.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 2430140302011 its reverse (1102030410342), we get a palindrome (3532170712353).
The spelling of 2430140302011 in words is "two trillion, four hundred thirty billion, one hundred forty million, three hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •