Base | Representation |
---|---|
bin | 1001111100111110… |
… | …11110010001001100 |
3 | 111210101120002211210 |
4 | 10332133132101030 |
5 | 41420402431012 |
6 | 2242115414420 |
7 | 246262123422 |
oct | 47637362114 |
9 | 14711502753 |
10 | 5343405132 |
11 | 22a22383aa |
12 | 10515b4410 |
13 | 6720460b0 |
14 | 389933112 |
15 | 21418b23c |
hex | 13e7de44c |
5343405132 has 48 divisors (see below), whose sum is σ = 13437940320. Its totient is φ = 1642787328.
The previous prime is 5343405091. The next prime is 5343405161. The reversal of 5343405132 is 2315043435.
It is a self number, because there is not a number n which added to its sum of digits gives 5343405132.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 187798 + ... + 214370.
It is an arithmetic number, because the mean of its divisors is an integer number (279957090).
Almost surely, 25343405132 is an apocalyptic number.
5343405132 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5343405132 is an abundant number, since it is smaller than the sum of its proper divisors (8094535188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5343405132 is a wasteful number, since it uses less digits than its factorization.
5343405132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27882 (or 27880 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
The square root of 5343405132 is about 73098.5987006591. The cubic root of 5343405132 is about 1748.2600536978.
Adding to 5343405132 its reverse (2315043435), we get a palindrome (7658448567).
The spelling of 5343405132 in words is "five billion, three hundred forty-three million, four hundred five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •