Base | Representation |
---|---|
bin | 100010110011001011011011… |
… | …010101100111000110001101 |
3 | 202001220111012121010202122011 |
4 | 202303023123111213012031 |
5 | 130030040003343014013 |
6 | 1301302241031421221 |
7 | 44144352112163206 |
oct | 4263133325470615 |
9 | 661814177122564 |
10 | 153050544501133 |
11 | 4484840a395824 |
12 | 151ba279824811 |
13 | 67527b1ba2146 |
14 | 29b19860a05ad |
15 | 12a62e1221c3d |
hex | 8b32db56718d |
153050544501133 has 8 divisors (see below), whose sum is σ = 162054513552960. Its totient is φ = 144046686098880.
The previous prime is 153050544501089. The next prime is 153050544501143. The reversal of 153050544501133 is 331105445050351.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 153050544501133 - 213 = 153050544492941 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 (153050544501143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24806193 + ... + 30355366.
It is an arithmetic number, because the mean of its divisors is an integer number (20256814194120).
Almost surely, 2153050544501133 is an apocalyptic number.
It is an amenable number.
153050544501133 is a deficient number, since it is larger than the sum of its proper divisors (9003969051827).
153050544501133 is a wasteful number, since it uses less digits than its factorization.
153050544501133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55324787.
The product of its (nonzero) digits is 270000, while the sum is 40.
Adding to 153050544501133 its reverse (331105445050351), we get a palindrome (484155989551484).
The spelling of 153050544501133 in words is "one hundred fifty-three trillion, fifty billion, five hundred forty-four million, five hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •