Base | Representation |
---|---|
bin | 111111100110100… |
… | …0110111001011001 |
3 | 12111201202200012210 |
4 | 1333031012321121 |
5 | 13332320030203 |
6 | 551434025333 |
7 | 103612624644 |
oct | 17715067131 |
9 | 5451680183 |
10 | 2134142553 |
11 | 9a5738984 |
12 | 4b6878249 |
13 | 2801b355a |
14 | 163616a5b |
15 | c755d803 |
hex | 7f346e59 |
2134142553 has 8 divisors (see below), whose sum is σ = 2845813600. Its totient is φ = 1422616608.
The previous prime is 2134142551. The next prime is 2134142597. The reversal of 2134142553 is 3552414312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2134142553 - 21 = 2134142551 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2134142553.
It is not an unprimeable number, because it can be changed into a prime (2134142551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4638 + ... + 65496.
It is an arithmetic number, because the mean of its divisors is an integer number (355726700).
Almost surely, 22134142553 is an apocalyptic number.
It is an amenable number.
2134142553 is a deficient number, since it is larger than the sum of its proper divisors (711671047).
2134142553 is a wasteful number, since it uses less digits than its factorization.
2134142553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72551.
The product of its digits is 14400, while the sum is 30.
The square root of 2134142553 is about 46196.7807644645. The cubic root of 2134142553 is about 1287.4819282724.
Adding to 2134142553 its reverse (3552414312), we get a palindrome (5686556865).
The spelling of 2134142553 in words is "two billion, one hundred thirty-four million, one hundred forty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •