Base | Representation |
---|---|
bin | 11001111111100110000001… |
… | …111011101110001011011110 |
3 | 112222210000022122212000010110 |
4 | 121333212001323232023132 |
5 | 104441020033023343032 |
6 | 1043050254051350450 |
7 | 33036304664250300 |
oct | 3177460173561336 |
9 | 488700278760113 |
10 | 114321324434142 |
11 | 33476446324051 |
12 | 109a42a42b2426 |
13 | 4ba35baab4b57 |
14 | 2033278549970 |
15 | d33b600127cc |
hex | 67f981eee2de |
114321324434142 has 48 divisors (see below), whose sum is σ = 266518205124480. Its totient is φ = 32596165212912.
The previous prime is 114321324434129. The next prime is 114321324434173. The reversal of 114321324434142 is 241434423123411.
It is a self number, because there is not a number n which added to its sum of digits gives 114321324434142.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 399084792 + ... + 399371147.
It is an arithmetic number, because the mean of its divisors is an integer number (5552462606760).
Almost surely, 2114321324434142 is an apocalyptic number.
114321324434142 is an abundant number, since it is smaller than the sum of its proper divisors (152196880690338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114321324434142 is a wasteful number, since it uses less digits than its factorization.
114321324434142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 798456445 (or 798456438 counting only the distinct ones).
The product of its digits is 221184, while the sum is 39.
Adding to 114321324434142 its reverse (241434423123411), we get a palindrome (355755747557553).
The spelling of 114321324434142 in words is "one hundred fourteen trillion, three hundred twenty-one billion, three hundred twenty-four million, four hundred thirty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •