Base | Representation |
---|---|
bin | 11001111100101100100010… |
… | …010101101101111100001001 |
3 | 112222001222020000001011101001 |
4 | 121330230202111231330021 |
5 | 104424234131421444203 |
6 | 1042414554250055001 |
7 | 33016024213553434 |
oct | 3174544225557411 |
9 | 488058200034331 |
10 | 114122152140553 |
11 | 333a9a297a7a37 |
12 | 10971779a1a461 |
13 | 4b8a8990c98ab |
14 | 202778236681b |
15 | d2d8a458991d |
hex | 67cb2256df09 |
114122152140553 has 4 divisors (see below), whose sum is σ = 114131438681620. Its totient is φ = 114112865599488.
The previous prime is 114122152140547. The next prime is 114122152140583. The reversal of 114122152140553 is 355041251221411.
It is a happy number.
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 96399171982864 + 17722980157689 = 9818308^2 + 4209867^2 .
It is a cyclic number.
It is not a de Polignac number, because 114122152140553 - 233 = 114113562205961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114122152140583) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4643252100 + ... + 4643276677.
It is an arithmetic number, because the mean of its divisors is an integer number (28532859670405).
Almost surely, 2114122152140553 is an apocalyptic number.
It is an amenable number.
114122152140553 is a deficient number, since it is larger than the sum of its proper divisors (9286541067).
114122152140553 is an equidigital number, since it uses as much as digits as its factorization.
114122152140553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9286541066.
The product of its (nonzero) digits is 48000, while the sum is 37.
The spelling of 114122152140553 in words is "one hundred fourteen trillion, one hundred twenty-two billion, one hundred fifty-two million, one hundred forty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •