Base | Representation |
---|---|
bin | 11001111101010110011011… |
… | …111101110000000001100110 |
3 | 112222020021100110001122121211 |
4 | 121331112123331300001212 |
5 | 104431003301420212300 |
6 | 1042451354450302034 |
7 | 33022206134206543 |
oct | 3175263375600146 |
9 | 488207313048554 |
10 | 114167142350950 |
11 | 334170165869a7 |
12 | 1097a434b8791a |
13 | 4b91bb8c90b70 |
14 | 2029a0d5a7bca |
15 | d2eb391e24ba |
hex | 67d59bf70066 |
114167142350950 has 48 divisors (see below), whose sum is σ = 228705908666256. Its totient is φ = 42150272400000.
The previous prime is 114167142350939. The next prime is 114167142350959. The reversal of 114167142350950 is 59053241761411.
It is a junction number, because it is equal to n+sod(n) for n = 114167142350894 and 114167142350903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114167142350959) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 492457 + ... + 15118756.
It is an arithmetic number, because the mean of its divisors is an integer number (4764706430547).
Almost surely, 2114167142350950 is an apocalyptic number.
114167142350950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114167142350950 is an abundant number, since it is smaller than the sum of its proper divisors (114538766315306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114167142350950 is a wasteful number, since it uses less digits than its factorization.
114167142350950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15622489 (or 15622484 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 49.
The spelling of 114167142350950 in words is "one hundred fourteen trillion, one hundred sixty-seven billion, one hundred forty-two million, three hundred fifty thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •