Base | Representation |
---|---|
bin | 1001000011011110010… |
… | …0011110101000101011 |
3 | 112212111121220020200120 |
4 | 2100313210132220223 |
5 | 10022032042212303 |
6 | 155243104334323 |
7 | 14144462544105 |
oct | 2206744365053 |
9 | 485447806616 |
10 | 155551132203 |
11 | 5aa72616a15 |
12 | 261919143a3 |
13 | 1188c65697c |
14 | 7758b18575 |
15 | 40a60ee553 |
hex | 243791ea2b |
155551132203 has 8 divisors (see below), whose sum is σ = 207493005888. Its totient is φ = 103655006664.
The previous prime is 155551132199. The next prime is 155551132223. The reversal of 155551132203 is 302231155551.
It is a happy number.
155551132203 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 not a de Polignac number, because 155551132203 - 22 = 155551132199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (155551132223) 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, 11429101 + ... + 11442702.
It is an arithmetic number, because the mean of its divisors is an integer number (25936625736).
Almost surely, 2155551132203 is an apocalyptic number.
155551132203 is a deficient number, since it is larger than the sum of its proper divisors (51941873685).
155551132203 is a wasteful number, since it uses less digits than its factorization.
155551132203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22874073.
The product of its (nonzero) digits is 22500, while the sum is 33.
Adding to 155551132203 its reverse (302231155551), we get a palindrome (457782287754).
The spelling of 155551132203 in words is "one hundred fifty-five billion, five hundred fifty-one million, one hundred thirty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •