Base | Representation |
---|---|
bin | 10110100110001001110… |
… | …011010010010000000000 |
3 | 12111110000221221221102101 |
4 | 112212021303102100000 |
5 | 200420111022212134 |
6 | 3145202204200144 |
7 | 220120465500100 |
oct | 26461163222000 |
9 | 5443027857371 |
10 | 1552795116544 |
11 | 54959a3a8911 |
12 | 210b37b39054 |
13 | b3574293839 |
14 | 552272ad200 |
15 | 2a5d2311e14 |
hex | 16989cd2400 |
1552795116544 has 99 divisors (see below), whose sum is σ = 3611510597907. Its totient is φ = 665363994624.
The previous prime is 1552795116511. The next prime is 1552795116569. The reversal of 1552795116544 is 4456115972551.
The square root of 1552795116544 is 1246112.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×15527951165442 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 279126307 + ... + 279131869.
Almost surely, 21552795116544 is an apocalyptic number.
1552795116544 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1552795116544 is the 1246112-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1552795116544
1552795116544 is an abundant number, since it is smaller than the sum of its proper divisors (2058715481363).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1552795116544 is an frugal number, since it uses more digits than its factorization.
1552795116544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11160 (or 5572 counting only the distinct ones).
The product of its digits is 7560000, while the sum is 55.
The spelling of 1552795116544 in words is "one trillion, five hundred fifty-two billion, seven hundred ninety-five million, one hundred sixteen thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •