Base | Representation |
---|---|
bin | 100011010111010010100110… |
… | …000001111000110101100000 |
3 | 202101200201122100012120102211 |
4 | 203113102212001320311200 |
5 | 130341214311124014202 |
6 | 1310442251310051504 |
7 | 44521553310323254 |
oct | 4327224601706540 |
9 | 671621570176384 |
10 | 155532141235552 |
11 | 456148a1016204 |
12 | 1553b2074a9b94 |
13 | 68a280593ac03 |
14 | 2a59b1d972264 |
15 | 12eab3436d1d7 |
hex | 8d74a6078d60 |
155532141235552 has 12 divisors (see below), whose sum is σ = 306203903057556. Its totient is φ = 77766070617760.
The previous prime is 155532141235547. The next prime is 155532141235651. The reversal of 155532141235552 is 255532141235551.
155532141235552 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 155532141235496 and 155532141235505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2430189706774 + ... + 2430189706837.
It is an arithmetic number, because the mean of its divisors is an integer number (25516991921463).
Almost surely, 2155532141235552 is an apocalyptic number.
It is an amenable number.
155532141235552 is a deficient number, since it is larger than the sum of its proper divisors (150671761822004).
155532141235552 is an equidigital number, since it uses as much as digits as its factorization.
155532141235552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4860379413621 (or 4860379413613 counting only the distinct ones).
The product of its digits is 4500000, while the sum is 49.
Subtracting 155532141235552 from its reverse (255532141235551), we obtain a palindrome (99999999999999).
The spelling of 155532141235552 in words is "one hundred fifty-five trillion, five hundred thirty-two billion, one hundred forty-one million, two hundred thirty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •