Base | Representation |
---|---|
bin | 11001111110101110011010… |
… | …010011010000011111101010 |
3 | 112222120022011121210010202120 |
4 | 121332232122103100133222 |
5 | 104434030231022340200 |
6 | 1043003020041212110 |
7 | 33032062025436531 |
oct | 3176563223203752 |
9 | 488508147703676 |
10 | 114261603715050 |
11 | 3345308a559960 |
12 | 109947b7a91036 |
13 | 4b9aa9117cc4c |
14 | 2030410bd5318 |
15 | d323170799a0 |
hex | 67eb9a4d07ea |
114261603715050 has 48 divisors (see below), whose sum is σ = 309129575146272. Its totient is φ = 27699782718400.
The previous prime is 114261603715043. The next prime is 114261603715079. The reversal of 114261603715050 is 50517306162411.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 114261603714993 and 114261603715011.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34624726749 + ... + 34624730048.
It is an arithmetic number, because the mean of its divisors is an integer number (6440199482214).
Almost surely, 2114261603715050 is an apocalyptic number.
114261603715050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114261603715050 is an abundant number, since it is smaller than the sum of its proper divisors (194867971431222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114261603715050 is a wasteful number, since it uses less digits than its factorization.
114261603715050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69249456823 (or 69249456818 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 42.
Adding to 114261603715050 its reverse (50517306162411), we get a palindrome (164778909877461).
The spelling of 114261603715050 in words is "one hundred fourteen trillion, two hundred sixty-one billion, six hundred three million, seven hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •