Base | Representation |
---|---|
bin | 1001000001101000000… |
… | …1111010010010000111 |
3 | 112211020002100002211202 |
4 | 2100122001322102013 |
5 | 10020023203444033 |
6 | 155122002053115 |
7 | 14126264161052 |
oct | 2203201722207 |
9 | 484202302752 |
10 | 155055531143 |
11 | 5a838894567 |
12 | 2607394a19b |
13 | 11810a81bc6 |
14 | 770cd89a99 |
15 | 40778548e8 |
hex | 241a07a487 |
155055531143 has 4 divisors (see below), whose sum is σ = 158837373408. Its totient is φ = 151273688880.
The previous prime is 155055531139. The next prime is 155055531157. The reversal of 155055531143 is 341135550551.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 155055531143 - 22 = 155055531139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 155055531097 and 155055531106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155055534143) 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, 1890921071 + ... + 1890921152.
It is an arithmetic number, because the mean of its divisors is an integer number (39709343352).
Almost surely, 2155055531143 is an apocalyptic number.
155055531143 is a deficient number, since it is larger than the sum of its proper divisors (3781842265).
155055531143 is an equidigital number, since it uses as much as digits as its factorization.
155055531143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3781842264.
The product of its (nonzero) digits is 112500, while the sum is 38.
The spelling of 155055531143 in words is "one hundred fifty-five billion, fifty-five million, five hundred thirty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •