Base | Representation |
---|---|
bin | 11010000111000011001100… |
… | …111011000111010000011110 |
3 | 120001120222210212011011100121 |
4 | 122013003030323013100132 |
5 | 110022413341010033032 |
6 | 1044121511020145154 |
7 | 33121313506033426 |
oct | 3207031473072036 |
9 | 501528725134317 |
10 | 114833683674142 |
11 | 336537677a9484 |
12 | 10a676543981ba |
13 | 4c0ca01637294 |
14 | 204dda0d81486 |
15 | d4214abc7a97 |
hex | 6870ccec741e |
114833683674142 has 8 divisors (see below), whose sum is σ = 174821428877256. Its totient is φ = 56559874048392.
The previous prime is 114833683674113. The next prime is 114833683674161. The reversal of 114833683674142 is 241476386338411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 428483894173 + ... + 428483894440.
It is an arithmetic number, because the mean of its divisors is an integer number (21852678609657).
Almost surely, 2114833683674142 is an apocalyptic number.
114833683674142 is a deficient number, since it is larger than the sum of its proper divisors (59987745203114).
114833683674142 is an equidigital number, since it uses as much as digits as its factorization.
114833683674142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 856967788682.
The product of its digits is 55738368, while the sum is 61.
The spelling of 114833683674142 in words is "one hundred fourteen trillion, eight hundred thirty-three billion, six hundred eighty-three million, six hundred seventy-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •