Base | Representation |
---|---|
bin | 11010000010110011101100… |
… | …010101111001001100100101 |
3 | 120000120010022120210002000121 |
4 | 122002303230111321030211 |
5 | 110003124312132341010 |
6 | 1043335534430241541 |
7 | 33061253221221145 |
oct | 3202635425711445 |
9 | 500503276702017 |
10 | 114542153012005 |
11 | 335510662a4064 |
12 | 10a1b0533562b1 |
13 | 4bbb3813593c4 |
14 | 203dc2699a925 |
15 | d39786d223da |
hex | 682cec579325 |
114542153012005 has 4 divisors (see below), whose sum is σ = 137450583614412. Its totient is φ = 91633722409600.
The previous prime is 114542153011973. The next prime is 114542153012011. The reversal of 114542153012005 is 500210351245411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14462497155681 + 100079655856324 = 3802959^2 + 10003982^2 .
It is not a de Polignac number, because 114542153012005 - 25 = 114542153011973 is a prime.
It is a Duffinian number.
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, 11454215301196 + ... + 11454215301205.
It is an arithmetic number, because the mean of its divisors is an integer number (34362645903603).
Almost surely, 2114542153012005 is an apocalyptic number.
It is an amenable number.
114542153012005 is a deficient number, since it is larger than the sum of its proper divisors (22908430602407).
114542153012005 is an equidigital number, since it uses as much as digits as its factorization.
114542153012005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22908430602406.
The product of its (nonzero) digits is 24000, while the sum is 34.
The spelling of 114542153012005 in words is "one hundred fourteen trillion, five hundred forty-two billion, one hundred fifty-three million, twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •