Base | Representation |
---|---|
bin | 10000000011011100000… |
… | …11001011001111111101 |
3 | 1221201210002202000222201 |
4 | 20001232003023033331 |
5 | 33014140121441112 |
6 | 1101222540111501 |
7 | 54565133554555 |
oct | 10015603131775 |
9 | 1851702660881 |
10 | 551602140157 |
11 | 1a2a2a034122 |
12 | 8aaa2535591 |
13 | 40028ac2713 |
14 | 1c9aa644165 |
15 | e535e9b257 |
hex | 806e0cb3fd |
551602140157 has 4 divisors (see below), whose sum is σ = 551607285276. Its totient is φ = 551596995040.
The previous prime is 551602140127. The next prime is 551602140163. The reversal of 551602140157 is 751041206155.
551602140157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 298000259236 + 253601880921 = 545894^2 + 503589^2 .
It is a cyclic number.
It is not a de Polignac number, because 551602140157 - 219 = 551601615869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551602140127) 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, 2408248 + ... + 2627329.
It is an arithmetic number, because the mean of its divisors is an integer number (137901821319).
Almost surely, 2551602140157 is an apocalyptic number.
It is an amenable number.
551602140157 is a deficient number, since it is larger than the sum of its proper divisors (5145119).
551602140157 is a wasteful number, since it uses less digits than its factorization.
551602140157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5145118.
The product of its (nonzero) digits is 42000, while the sum is 37.
The spelling of 551602140157 in words is "five hundred fifty-one billion, six hundred two million, one hundred forty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •