Base | Representation |
---|---|
bin | 10010100010110… |
… | …00001000010111 |
3 | 101211200202210200 |
4 | 21101120020113 |
5 | 304310101411 |
6 | 23233551543 |
7 | 3566104134 |
oct | 1121301027 |
9 | 354622720 |
10 | 155550231 |
11 | 7a893211 |
12 | 441155b3 |
13 | 262c3275 |
14 | 1693158b |
15 | d9c8e56 |
hex | 9458217 |
155550231 has 6 divisors (see below), whose sum is σ = 224683680. Its totient is φ = 103700148.
The previous prime is 155550223. The next prime is 155550247. The reversal of 155550231 is 132055551.
155550231 is a `hidden beast` number, since 155 + 5 + 502 + 3 + 1 = 666.
It is not a de Polignac number, because 155550231 - 23 = 155550223 is a prime.
It is a super-2 number, since 2×1555502312 = 48391748728306722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 155550195 and 155550204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155550251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8641671 + ... + 8641688.
It is an arithmetic number, because the mean of its divisors is an integer number (37447280).
Almost surely, 2155550231 is an apocalyptic number.
155550231 is a deficient number, since it is larger than the sum of its proper divisors (69133449).
155550231 is a wasteful number, since it uses less digits than its factorization.
155550231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17283365 (or 17283362 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 155550231 is about 12471.9778303203. The cubic root of 155550231 is about 537.8034123259.
The spelling of 155550231 in words is "one hundred fifty-five million, five hundred fifty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •