Base | Representation |
---|---|
bin | 100101111010000110011… |
… | …0100011100010100100010 |
3 | 200110001221120202000211010 |
4 | 1023310030310130110202 |
5 | 1140330100130413010 |
6 | 15025240140201350 |
7 | 1045260625512630 |
oct | 113641464342442 |
9 | 20401846660733 |
10 | 5210010404130 |
11 | 172960a059524 |
12 | 701899b39256 |
13 | 2ba3c02a439c |
14 | 140247138350 |
15 | 907ce90b620 |
hex | 4bd0cd1c522 |
5210010404130 has 32 divisors (see below), whose sum is σ = 14290314251904. Its totient is φ = 1190859520896.
The previous prime is 5210010404129. The next prime is 5210010404161. The reversal of 5210010404130 is 314040100125.
It is a super-2 number, since 2×52100104041302 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 5210010404097 and 5210010404106.
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, 12404786467 + ... + 12404786886.
It is an arithmetic number, because the mean of its divisors is an integer number (446572320372).
Almost surely, 25210010404130 is an apocalyptic number.
5210010404130 is an abundant number, since it is smaller than the sum of its proper divisors (9080303847774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5210010404130 is a wasteful number, since it uses less digits than its factorization.
5210010404130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24809573370.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 5210010404130 its reverse (314040100125), we get a palindrome (5524050504255).
The spelling of 5210010404130 in words is "five trillion, two hundred ten billion, ten million, four hundred four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •