Base | Representation |
---|---|
bin | 10110100101000000010… |
… | …000000100111000110000 |
3 | 12111022211222000221112210 |
4 | 112211000100010320300 |
5 | 200410044123300000 |
6 | 3144435524052120 |
7 | 220045063113021 |
oct | 26450020047060 |
9 | 5438758027483 |
10 | 1551561150000 |
11 | 549016902554 |
12 | 210852834040 |
13 | b3408738b14 |
14 | 5514b45ac48 |
15 | 2a55dd17350 |
hex | 16940404e30 |
1551561150000 has 120 divisors (see below), whose sum is σ = 5009929375248. Its totient is φ = 413749600000.
The previous prime is 1551561149993. The next prime is 1551561150019. The reversal of 1551561150000 is 511651551.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a self number, because there is not a number n which added to its sum of digits gives 1551561150000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5021871 + ... + 5321870.
Almost surely, 21551561150000 is an apocalyptic number.
1551561150000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1551561150000 is an abundant number, since it is smaller than the sum of its proper divisors (3458368225248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1551561150000 is an equidigital number, since it uses as much as digits as its factorization.
1551561150000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10343777 (or 10343751 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 1551561150000 in words is "one trillion, five hundred fifty-one billion, five hundred sixty-one million, one hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •