Base | Representation |
---|---|
bin | 100110111111001001111… |
… | …1001000111010000100001 |
3 | 200222020201112000102200201 |
4 | 1031332103321013100201 |
5 | 1200242302143101201 |
6 | 15221323241345201 |
7 | 1062060542520415 |
oct | 115762371072041 |
9 | 20866645012621 |
10 | 5358305440801 |
11 | 1786498804475 |
12 | 726585798201 |
13 | 2cb39455a0b1 |
14 | 1474b42b0d45 |
15 | 945ad9a6801 |
hex | 4df93e47421 |
5358305440801 has 4 divisors (see below), whose sum is σ = 5359626200452. Its totient is φ = 5356984681152.
The previous prime is 5358305440783. The next prime is 5358305440811. The reversal of 5358305440801 is 1080445038535.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1419672250000 + 3938633190801 = 1191500^2 + 1984599^2 .
It is a cyclic number.
It is not a de Polignac number, because 5358305440801 - 25 = 5358305440769 is a prime.
It is a super-2 number, since 2×53583054408012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5358305440811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 660373740 + ... + 660381853.
It is an arithmetic number, because the mean of its divisors is an integer number (1339906550113).
Almost surely, 25358305440801 is an apocalyptic number.
It is an amenable number.
5358305440801 is a deficient number, since it is larger than the sum of its proper divisors (1320759651).
5358305440801 is a wasteful number, since it uses less digits than its factorization.
5358305440801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1320759650.
The product of its (nonzero) digits is 1152000, while the sum is 46.
The spelling of 5358305440801 in words is "five trillion, three hundred fifty-eight billion, three hundred five million, four hundred forty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •