Base | Representation |
---|---|
bin | 100101001001001100111… |
… | …0001100101011100001001 |
3 | 200002000220022010122102020 |
4 | 1022102121301211130021 |
5 | 1132120020232410410 |
6 | 14505112145355053 |
7 | 1034552454021612 |
oct | 112223161453411 |
9 | 20060808118366 |
10 | 5105001060105 |
11 | 1699023014091 |
12 | 6a5472638a89 |
13 | 2b0526a13c6b |
14 | 139124aa2c09 |
15 | 8cbd5a21a70 |
hex | 4a499c65709 |
5105001060105 has 32 divisors (see below), whose sum is σ = 8255327414400. Its totient is φ = 2693713085952.
The previous prime is 5105001060059. The next prime is 5105001060163. The reversal of 5105001060105 is 5010601005015.
It is not a de Polignac number, because 5105001060105 - 226 = 5104933951241 is a prime.
It is a super-2 number, since 2×51050010601052 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
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 31 ways as a sum of consecutive naturals, for example, 4296700 + ... + 5354589.
It is an arithmetic number, because the mean of its divisors is an integer number (257978981700).
Almost surely, 25105001060105 is an apocalyptic number.
It is an amenable number.
5105001060105 is a deficient number, since it is larger than the sum of its proper divisors (3150326354295).
5105001060105 is a wasteful number, since it uses less digits than its factorization.
5105001060105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9651673.
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 5105001060105 in words is "five trillion, one hundred five billion, one million, sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •