Base | Representation |
---|---|
bin | 1001000011101010101… |
… | …1010011010001010111 |
3 | 112212122020222020000221 |
4 | 2100322223103101113 |
5 | 10022133413033221 |
6 | 155252205415211 |
7 | 14145664551553 |
oct | 2207253232127 |
9 | 485566866027 |
10 | 155603252311 |
11 | 5aa99a85591 |
12 | 261a726a507 |
13 | 1189a3a5080 |
14 | 7761a04863 |
15 | 40aa997541 |
hex | 243aad3457 |
155603252311 has 8 divisors (see below), whose sum is σ = 168111556704. Its totient is φ = 143171922720.
The previous prime is 155603252263. The next prime is 155603252323. The reversal of 155603252311 is 113252306551.
155603252311 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 a cyclic number.
It is not a de Polignac number, because 155603252311 - 211 = 155603250263 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155603252011) 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, 19239496 + ... + 19247581.
It is an arithmetic number, because the mean of its divisors is an integer number (21013944588).
Almost surely, 2155603252311 is an apocalyptic number.
155603252311 is a deficient number, since it is larger than the sum of its proper divisors (12508304393).
155603252311 is a wasteful number, since it uses less digits than its factorization.
155603252311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38487401.
The product of its (nonzero) digits is 27000, while the sum is 34.
Adding to 155603252311 its reverse (113252306551), we get a palindrome (268855558862).
The spelling of 155603252311 in words is "one hundred fifty-five billion, six hundred three million, two hundred fifty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •