Base | Representation |
---|---|
bin | 101100011110000001100… |
… | …100011101000100000000 |
3 | 101211010210121122011020100 |
4 | 230132001210131010000 |
5 | 400031433231031134 |
6 | 10255505315242400 |
7 | 433531640500464 |
oct | 54360144350400 |
9 | 11733717564210 |
10 | 3055895564544 |
11 | a78aa8419719 |
12 | 4143052a9400 |
13 | 192228b31054 |
14 | a7c9860c4a4 |
15 | 54756992999 |
hex | 2c78191d100 |
3055895564544 has 243 divisors, whose sum is σ = 8943242002149. Its totient is φ = 1003556136960.
The previous prime is 3055895564507. The next prime is 3055895564569. The reversal of 3055895564544 is 4454655985503.
The square root of 3055895564544 is 1748112.
It is a perfect power (a square), and thus also a powerful number.
3055895564544 is a `hidden beast` number, since 3 + 0 + 5 + 5 + 89 + 5 + 5 + 6 + 4 + 544 = 666.
It can be written as a sum of positive squares in only one way, i.e., 979529842944 + 2076365721600 = 989712^2 + 1440960^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 6628840474 + ... + 6628840934.
Almost surely, 23055895564544 is an apocalyptic number.
3055895564544 is the 1748112-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3055895564544
3055895564544 is an abundant number, since it is smaller than the sum of its proper divisors (5887346437605).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3055895564544 is an frugal number, since it uses more digits than its factorization.
3055895564544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102 (or 545 counting only the distinct ones).
The product of its (nonzero) digits is 259200000, while the sum is 63.
The spelling of 3055895564544 in words is "three trillion, fifty-five billion, eight hundred ninety-five million, five hundred sixty-four thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •