Base | Representation |
---|---|
bin | 100011010000010100100110… |
… | …001101100010011110111111 |
3 | 202022222221112222002101102120 |
4 | 203100110212031202132333 |
5 | 130310343031342424343 |
6 | 1305434252053254023 |
7 | 44442141133230144 |
oct | 4320244615423677 |
9 | 668887488071376 |
10 | 155053255436223 |
11 | 4544a797511231 |
12 | 15482439634313 |
13 | 68695c7c7b301 |
14 | 2a408909cc3cb |
15 | 12dd4571e4683 |
hex | 8d05263627bf |
155053255436223 has 4 divisors (see below), whose sum is σ = 206737673914968. Its totient is φ = 103368836957480.
The previous prime is 155053255436221. The next prime is 155053255436251. The reversal of 155053255436223 is 322634552350551.
155053255436223 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 155053255436223 - 21 = 155053255436221 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155053255436221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25842209239368 + ... + 25842209239373.
It is an arithmetic number, because the mean of its divisors is an integer number (51684418478742).
Almost surely, 2155053255436223 is an apocalyptic number.
155053255436223 is a deficient number, since it is larger than the sum of its proper divisors (51684418478745).
155053255436223 is an equidigital number, since it uses as much as digits as its factorization.
155053255436223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51684418478744.
The product of its (nonzero) digits is 16200000, while the sum is 51.
The spelling of 155053255436223 in words is "one hundred fifty-five trillion, fifty-three billion, two hundred fifty-five million, four hundred thirty-six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •