Base | Representation |
---|---|
bin | 100011011001000100101100… |
… | …001000010000001001101111 |
3 | 202102010102212012022111011122 |
4 | 203121010230020100021233 |
5 | 130400221210413311101 |
6 | 1311014431545011155 |
7 | 44533451222641616 |
oct | 4331045410201157 |
9 | 672112765274148 |
10 | 155654650135151 |
11 | 45661848102772 |
12 | 1555aab7483abb |
13 | 68b122a84c44b |
14 | 2a61a221a487d |
15 | 12ede0470b51b |
hex | 8d912c21026f |
155654650135151 has 32 divisors (see below), whose sum is σ = 172657276811136. Its totient is φ = 139574679552000.
The previous prime is 155654650135111. The next prime is 155654650135183. The reversal of 155654650135151 is 151531056456551.
It is a cyclic number.
It is not a de Polignac number, because 155654650135151 - 26 = 155654650135087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 155654650135093 and 155654650135102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155654650135111) 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 31 ways as a sum of consecutive naturals, for example, 276703811 + ... + 277265771.
It is an arithmetic number, because the mean of its divisors is an integer number (5395539900348).
Almost surely, 2155654650135151 is an apocalyptic number.
155654650135151 is a deficient number, since it is larger than the sum of its proper divisors (17002626675985).
155654650135151 is a wasteful number, since it uses less digits than its factorization.
155654650135151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564803.
The product of its (nonzero) digits is 6750000, while the sum is 53.
The spelling of 155654650135151 in words is "one hundred fifty-five trillion, six hundred fifty-four billion, six hundred fifty million, one hundred thirty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •