Base | Representation |
---|---|
bin | 10110101000010010001… |
… | …000001101110010100000 |
3 | 12111122221100201010200210 |
4 | 112220102020031302200 |
5 | 200434302032222142 |
6 | 3150221150414120 |
7 | 220231250331051 |
oct | 26502210156240 |
9 | 5448840633623 |
10 | 1555082304672 |
11 | 54a563469136 |
12 | 211475b01340 |
13 | b384a0a12b0 |
14 | 553a2d64728 |
15 | 2a6b800249c |
hex | 16a1220dca0 |
1555082304672 has 384 divisors, whose sum is σ = 4783629312000. Its totient is φ = 438048829440.
The previous prime is 1555082304667. The next prime is 1555082304701. The reversal of 1555082304672 is 2764032805551.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 785790979 + ... + 785792957.
It is an arithmetic number, because the mean of its divisors is an integer number (12457368000).
Almost surely, 21555082304672 is an apocalyptic number.
1555082304672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1555082304672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2391814656000).
1555082304672 is an abundant number, since it is smaller than the sum of its proper divisors (3228547007328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1555082304672 is a wasteful number, since it uses less digits than its factorization.
1555082304672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3124 (or 3116 counting only the distinct ones).
The product of its (nonzero) digits is 2016000, while the sum is 48.
The spelling of 1555082304672 in words is "one trillion, five hundred fifty-five billion, eighty-two million, three hundred four thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •