Base | Representation |
---|---|
bin | 1001111111000101… |
… | …10101101001010101 |
3 | 111211121210021222200 |
4 | 10333202311221111 |
5 | 41434413031113 |
6 | 2243550115113 |
7 | 246565203516 |
oct | 47742655125 |
9 | 14747707880 |
10 | 5361064533 |
11 | 23011aa150 |
12 | 10574aba99 |
13 | 6758ba046 |
14 | 38c00ca0d |
15 | 2159c8873 |
hex | 13f8b5a55 |
5361064533 has 48 divisors (see below), whose sum is σ = 8626647744. Its totient is φ = 3180602880.
The previous prime is 5361064523. The next prime is 5361064571. The reversal of 5361064533 is 3354601635.
5361064533 is a `hidden beast` number, since 5 + 3 + 6 + 1 + 0 + 645 + 3 + 3 = 666.
It is not a de Polignac number, because 5361064533 - 26 = 5361064469 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5361064523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3110610 + ... + 3112332.
It is an arithmetic number, because the mean of its divisors is an integer number (179721828).
Almost surely, 25361064533 is an apocalyptic number.
5361064533 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
5361064533 is a deficient number, since it is larger than the sum of its proper divisors (3265583211).
5361064533 is a wasteful number, since it uses less digits than its factorization.
5361064533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2386 (or 2383 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 36.
The square root of 5361064533 is about 73219.2907163133. The cubic root of 5361064533 is about 1750.1838754275.
The spelling of 5361064533 in words is "five billion, three hundred sixty-one million, sixty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •