Base | Representation |
---|---|
bin | 100101001001010100011… |
… | …1010110001000110100101 |
3 | 200002001120000012111111110 |
4 | 1022102220322301012211 |
5 | 1132121030303003123 |
6 | 14505153303055233 |
7 | 1034561660365032 |
oct | 112225072610645 |
9 | 20061500174443 |
10 | 5105255125413 |
11 | 1699143474113 |
12 | 6a5523741519 |
13 | 2b056754ab71 |
14 | 13914a71a389 |
15 | 8cbeceaa493 |
hex | 4a4a8eb11a5 |
5105255125413 has 8 divisors (see below), whose sum is σ = 6973031390976. Its totient is φ = 3320491138400.
The previous prime is 5105255125393. The next prime is 5105255125463. The reversal of 5105255125413 is 3145215525015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5105255125413 - 221 = 5105253028261 is a prime.
It is a super-3 number, since 3×51052551254133 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105255125463) 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 7 ways as a sum of consecutive naturals, for example, 20753069493 + ... + 20753069738.
It is an arithmetic number, because the mean of its divisors is an integer number (871628923872).
Almost surely, 25105255125413 is an apocalyptic number.
It is an amenable number.
5105255125413 is a deficient number, since it is larger than the sum of its proper divisors (1867776265563).
5105255125413 is a wasteful number, since it uses less digits than its factorization.
5105255125413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41506139275.
The product of its (nonzero) digits is 150000, while the sum is 39.
The spelling of 5105255125413 in words is "five trillion, one hundred five billion, two hundred fifty-five million, one hundred twenty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •