Base | Representation |
---|---|
bin | 1001111100110011… |
… | …00100000000000000 |
3 | 111210021122101111001 |
4 | 10332121210000000 |
5 | 41420003340434 |
6 | 2242022301344 |
7 | 246243011311 |
oct | 47631440000 |
9 | 14707571431 |
10 | 5341855744 |
11 | 22a137a315 |
12 | 1050b87854 |
13 | 671922ab4 |
14 | 38964c608 |
15 | 213e82114 |
hex | 13e664000 |
5341855744 has 45 divisors (see below), whose sum is σ = 10702128171. Its totient is φ = 2666250240.
The previous prime is 5341855741. The next prime is 5341855781. The reversal of 5341855744 is 4475581435.
The square root of 5341855744 is 73088.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5341855694 and 5341855703.
It is not an unprimeable number, because it can be changed into a prime (5341855741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 9354979 + ... + 9355549.
Almost surely, 25341855744 is an apocalyptic number.
5341855744 is the 73088-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5341855744
5341855744 is an abundant number, since it is smaller than the sum of its proper divisors (5360272427).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5341855744 is an frugal number, since it uses more digits than its factorization.
5341855744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1170 (or 573 counting only the distinct ones).
The product of its digits is 1344000, while the sum is 46.
The cubic root of 5341855744 is about 1748.0910606473.
The spelling of 5341855744 in words is "five billion, three hundred forty-one million, eight hundred fifty-five thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •