Base | Representation |
---|---|
bin | 100010001010100000010110… |
… | …100011101101101011000101 |
3 | 201201000021202010210100121201 |
4 | 202022200112203231223011 |
5 | 124143241243133003013 |
6 | 1251322232543142501 |
7 | 43435413500636242 |
oct | 4212402643555305 |
9 | 651007663710551 |
10 | 150255514344133 |
11 | 4397000776a910 |
12 | 14a286378a4a31 |
13 | 65ac05a1c1713 |
14 | 291659733a5c9 |
15 | 12587563ed3dd |
hex | 88a8168edac5 |
150255514344133 has 8 divisors (see below), whose sum is σ = 163923318565056. Its totient is φ = 136589078791200.
The previous prime is 150255514344119. The next prime is 150255514344137. The reversal of 150255514344133 is 331443415552051.
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 150255514344133 - 233 = 150246924409541 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 (150255514344137) 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, 341937441 + ... + 342376582.
It is an arithmetic number, because the mean of its divisors is an integer number (20490414820632).
Almost surely, 2150255514344133 is an apocalyptic number.
It is an amenable number.
150255514344133 is a deficient number, since it is larger than the sum of its proper divisors (13667804220923).
150255514344133 is a wasteful number, since it uses less digits than its factorization.
150255514344133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684333995.
The product of its (nonzero) digits is 2160000, while the sum is 46.
Adding to 150255514344133 its reverse (331443415552051), we get a palindrome (481698929896184).
The spelling of 150255514344133 in words is "one hundred fifty trillion, two hundred fifty-five billion, five hundred fourteen million, three hundred forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •