Base | Representation |
---|---|
bin | 1001000001111000010… |
… | …1010110110101101101 |
3 | 112211101211022111010102 |
4 | 2100132011112311231 |
5 | 10020143111342110 |
6 | 155132431520445 |
7 | 14131051235405 |
oct | 2203605266555 |
9 | 484354274112 |
10 | 155123543405 |
11 | 5a873218146 |
12 | 26092689125 |
13 | 11821ba5a4c |
14 | 7718011805 |
15 | 407d7db5a5 |
hex | 241e156d6d |
155123543405 has 8 divisors (see below), whose sum is σ = 186754600032. Its totient is φ = 123694602768.
The previous prime is 155123543317. The next prime is 155123543411. The reversal of 155123543405 is 504345321551.
155123543405 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 155123543405 - 210 = 155123542381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 50527307 + ... + 50530376.
It is an arithmetic number, because the mean of its divisors is an integer number (23344325004).
Almost surely, 2155123543405 is an apocalyptic number.
It is an amenable number.
155123543405 is a deficient number, since it is larger than the sum of its proper divisors (31631056627).
155123543405 is a wasteful number, since it uses less digits than its factorization.
155123543405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101057995.
The product of its (nonzero) digits is 180000, while the sum is 38.
Adding to 155123543405 its reverse (504345321551), we get a palindrome (659468864956).
The spelling of 155123543405 in words is "one hundred fifty-five billion, one hundred twenty-three million, five hundred forty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •