Base | Representation |
---|---|
bin | 1001000101000011000… |
… | …0111111100110101101 |
3 | 112220121002022012101211 |
4 | 2101100300333212231 |
5 | 10023413300441443 |
6 | 155353044434421 |
7 | 14161114536145 |
oct | 2212060774655 |
9 | 486532265354 |
10 | 155973843373 |
11 | 6016a194097 |
12 | 2628b3a8a11 |
13 | 119290ba71a |
14 | 7798d11925 |
15 | 40cd29c19d |
hex | 2450c3f9ad |
155973843373 has 8 divisors (see below), whose sum is σ = 164036855808. Its totient is φ = 148017626064.
The previous prime is 155973843367. The next prime is 155973843391. The reversal of 155973843373 is 373348379551.
155973843373 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-155973843373 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 (155973843173) 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, 26695786 + ... + 26701627.
It is an arithmetic number, because the mean of its divisors is an integer number (20504606976).
Almost surely, 2155973843373 is an apocalyptic number.
It is an amenable number.
155973843373 is a deficient number, since it is larger than the sum of its proper divisors (8063012435).
155973843373 is a wasteful number, since it uses less digits than its factorization.
155973843373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53397563.
The product of its digits is 28576800, while the sum is 58.
The spelling of 155973843373 in words is "one hundred fifty-five billion, nine hundred seventy-three million, eight hundred forty-three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •