Base | Representation |
---|---|
bin | 1001011011110100… |
… | …10011010110000101 |
3 | 111002000010010021100 |
4 | 10231322103112011 |
5 | 40333144204410 |
6 | 2154341210313 |
7 | 236343464406 |
oct | 45572232605 |
9 | 14060103240 |
10 | 5065225605 |
11 | 216a207a70 |
12 | b94400999 |
13 | 62951821b |
14 | 3609dd9ad |
15 | 1e9a3c8c0 |
hex | 12de93585 |
5065225605 has 48 divisors (see below), whose sum is σ = 9626198400. Its totient is φ = 2443478400.
The previous prime is 5065225603. The next prime is 5065225609.
5065225605 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5065225605 - 21 = 5065225603 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5065225605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5065225603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 72795 + ... + 124215.
It is an arithmetic number, because the mean of its divisors is an integer number (200545800).
Almost surely, 25065225605 is an apocalyptic number.
5065225605 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5065225605 is a deficient number, since it is larger than the sum of its proper divisors (4560972795).
5065225605 is a wasteful number, since it uses less digits than its factorization.
5065225605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51642 (or 51639 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The square root of 5065225605 is about 71170.3983760102. The cubic root of 5065225605 is about 1717.3794605309.
The spelling of 5065225605 in words is "five billion, sixty-five million, two hundred twenty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •