Base | Representation |
---|---|
bin | 100101100100001100110… |
… | …0100101100101100010011 |
3 | 200021120112221020202211222 |
4 | 1023020121210230230103 |
5 | 1134042240303143220 |
6 | 14551501245555255 |
7 | 1042004310461216 |
oct | 113103144545423 |
9 | 20246487222758 |
10 | 5162979740435 |
11 | 1710675512820 |
12 | 6b4753575b2b |
13 | 2b5b36770aba |
14 | 13bc64d0b77d |
15 | 8e47aa9ee25 |
hex | 4b21992cb13 |
5162979740435 has 16 divisors (see below), whose sum is σ = 6759384589152. Its totient is φ = 3754575052800.
The previous prime is 5162979740431. The next prime is 5162979740467. The reversal of 5162979740435 is 5340479792615.
It is a happy number.
It is not a de Polignac number, because 5162979740435 - 22 = 5162979740431 is a prime.
It is a super-4 number, since 4×51629797404354 (a number of 52 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5162979740431) 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 15 ways as a sum of consecutive naturals, for example, 3337676 + ... + 4633145.
It is an arithmetic number, because the mean of its divisors is an integer number (422461536822).
Almost surely, 25162979740435 is an apocalyptic number.
5162979740435 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5162979740435 is a deficient number, since it is larger than the sum of its proper divisors (1596404848717).
5162979740435 is a wasteful number, since it uses less digits than its factorization.
5162979740435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7982614.
The product of its (nonzero) digits is 57153600, while the sum is 62.
The spelling of 5162979740435 in words is "five trillion, one hundred sixty-two billion, nine hundred seventy-nine million, seven hundred forty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •