Base | Representation |
---|---|
bin | 100011010111010101101111… |
… | …000100110110110011000010 |
3 | 202101201001100102002122112010 |
4 | 203113111233010312303002 |
5 | 130341243213120442200 |
6 | 1310444010121113350 |
7 | 44522033015331156 |
oct | 4327255704666302 |
9 | 671631312078463 |
10 | 155535514234050 |
11 | 45616271a89975 |
12 | 1553b9a9028856 |
13 | 68a2c2269b802 |
14 | 2a59d5d911066 |
15 | 12eac80540150 |
hex | 8d756f136cc2 |
155535514234050 has 192 divisors, whose sum is σ = 410102440335360. Its totient is φ = 38928667008000.
The previous prime is 155535514234043. The next prime is 155535514234181. The reversal of 155535514234050 is 50432415535551.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 50179786 + ... + 53189114.
It is an arithmetic number, because the mean of its divisors is an integer number (2135950210080).
Almost surely, 2155535514234050 is an apocalyptic number.
155535514234050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 155535514234050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205051220167680).
155535514234050 is an abundant number, since it is smaller than the sum of its proper divisors (254566926101310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155535514234050 is a wasteful number, since it uses less digits than its factorization.
155535514234050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3009649 (or 3009644 counting only the distinct ones).
The product of its (nonzero) digits is 4500000, while the sum is 48.
The spelling of 155535514234050 in words is "one hundred fifty-five trillion, five hundred thirty-five billion, five hundred fourteen million, two hundred thirty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •