Base | Representation |
---|---|
bin | 100101001011010011001… |
… | …1000001101100011101000 |
3 | 200002110112100202111001210 |
4 | 1022112212120031203220 |
5 | 1132203232403323114 |
6 | 14511135245513120 |
7 | 1035102233660451 |
oct | 112264630154350 |
9 | 20073470674053 |
10 | 5109507479784 |
11 | 169aa25849974 |
12 | 6a630b8727a0 |
13 | 2b0a94527796 |
14 | 1394313a0128 |
15 | 8cd9b47c259 |
hex | 4a5a660d8e8 |
5109507479784 has 32 divisors (see below), whose sum is σ = 13214243484000. Its totient is φ = 1644439188672.
The previous prime is 5109507479777. The next prime is 5109507479801. The reversal of 5109507479784 is 4879747059015.
It is a super-2 number, since 2×51095074797842 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
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 7 ways as a sum of consecutive naturals, for example, 3670622494 + ... + 3670623885.
It is an arithmetic number, because the mean of its divisors is an integer number (412945108875).
Almost surely, 25109507479784 is an apocalyptic number.
It is an amenable number.
5109507479784 is an abundant number, since it is smaller than the sum of its proper divisors (8104736004216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5109507479784 is a wasteful number, since it uses less digits than its factorization.
5109507479784 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7341246417 (or 7341246413 counting only the distinct ones).
The product of its (nonzero) digits is 88905600, while the sum is 66.
The spelling of 5109507479784 in words is "five trillion, one hundred nine billion, five hundred seven million, four hundred seventy-nine thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •