Base | Representation |
---|---|
bin | 11001111110100111010110… |
… | …100100110110011001111110 |
3 | 112222112120121110010210200001 |
4 | 121332213112210312121332 |
5 | 104433414220401301100 |
6 | 1042555324031424514 |
7 | 33031403151564643 |
oct | 3176472644663176 |
9 | 488476543123601 |
10 | 114254025025150 |
11 | 3344a950591a7a |
12 | 1099324198513a |
13 | 4b9a153cccc5a |
14 | 202dcd247bdca |
15 | d32021a51d6a |
hex | 67e9d693667e |
114254025025150 has 24 divisors (see below), whose sum is σ = 212524743074904. Its totient is φ = 45698974197600.
The previous prime is 114254025025139. The next prime is 114254025025157. The reversal of 114254025025150 is 51520520452411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114254025025157) 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 11 ways as a sum of consecutive naturals, for example, 65019592 + ... + 66753691.
It is an arithmetic number, because the mean of its divisors is an integer number (8855197628121).
Almost surely, 2114254025025150 is an apocalyptic number.
114254025025150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114254025025150 is a deficient number, since it is larger than the sum of its proper divisors (98270718049754).
114254025025150 is a wasteful number, since it uses less digits than its factorization.
114254025025150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131790636 (or 131790631 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 37.
Adding to 114254025025150 its reverse (51520520452411), we get a palindrome (165774545477561).
The spelling of 114254025025150 in words is "one hundred fourteen trillion, two hundred fifty-four billion, twenty-five million, twenty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •