Base | Representation |
---|---|
bin | 1001011111001101… |
… | …01010011000101100 |
3 | 111010222120021212201 |
4 | 10233212222120230 |
5 | 40412432202112 |
6 | 2201234111244 |
7 | 240140103463 |
oct | 45746523054 |
9 | 14128507781 |
10 | 5093631532 |
11 | 2184249840 |
12 | ba1a1b524 |
13 | 632382772 |
14 | 3646b59da |
15 | 1ec29e257 |
hex | 12f9aa62c |
5093631532 has 24 divisors (see below), whose sum is σ = 9745247232. Its totient is φ = 2310277200.
The previous prime is 5093631493. The next prime is 5093631553. The reversal of 5093631532 is 2351363905.
It is a junction number, because it is equal to n+sod(n) for n = 5093631491 and 5093631500.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104644 + ... + 145387.
It is an arithmetic number, because the mean of its divisors is an integer number (406051968).
Almost surely, 25093631532 is an apocalyptic number.
It is an amenable number.
5093631532 is a deficient number, since it is larger than the sum of its proper divisors (4651615700).
5093631532 is a wasteful number, since it uses less digits than its factorization.
5093631532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250509 (or 250507 counting only the distinct ones).
The product of its (nonzero) digits is 72900, while the sum is 37.
The square root of 5093631532 is about 71369.6821626662. The cubic root of 5093631532 is about 1720.5838485741.
The spelling of 5093631532 in words is "five billion, ninety-three million, six hundred thirty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •