Base | Representation |
---|---|
bin | 111110110111011011111… |
… | …001011111000101110110 |
3 | 120022000000101102102202210 |
4 | 332313123321133011312 |
5 | 1031240112120143332 |
6 | 13104350241114250 |
7 | 624055612054644 |
oct | 76673371370566 |
9 | 16260011372683 |
10 | 4320131412342 |
11 | 1416180613a29 |
12 | 59932b328986 |
13 | 2545045c3545 |
14 | 10d149db4194 |
15 | 7759abe1ecc |
hex | 3eddbe5f176 |
4320131412342 has 8 divisors (see below), whose sum is σ = 8640262824696. Its totient is φ = 1440043804112.
The previous prime is 4320131412301. The next prime is 4320131412347. The reversal of 4320131412342 is 2432141310234.
It is a sphenic number, since it is the product of 3 distinct primes.
4320131412342 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4320131412347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 360010951023 + ... + 360010951034.
It is an arithmetic number, because the mean of its divisors is an integer number (1080032853087).
Almost surely, 24320131412342 is an apocalyptic number.
4320131412342 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4320131412342 is a wasteful number, since it uses less digits than its factorization.
4320131412342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720021902062.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 4320131412342 its reverse (2432141310234), we get a palindrome (6752272722576).
The spelling of 4320131412342 in words is "four trillion, three hundred twenty billion, one hundred thirty-one million, four hundred twelve thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •