Base | Representation |
---|---|
bin | 100100110100101111010… |
… | …1011111011111010000101 |
3 | 122220211110222101002011110 |
4 | 1021221132223323322011 |
5 | 1130410022333104230 |
6 | 14433004025155233 |
7 | 1031435533425231 |
oct | 111513653737205 |
9 | 18824428332143 |
10 | 5061060050565 |
11 | 1681424503272 |
12 | 698a4a92bb19 |
13 | 2a93433255bc |
14 | 136d56d395c1 |
15 | 8b9b30684b0 |
hex | 49a5eafbe85 |
5061060050565 has 16 divisors (see below), whose sum is σ = 8449769824128. Its totient is φ = 2581874112576.
The previous prime is 5061060050531. The next prime is 5061060050671. The reversal of 5061060050565 is 5650500601605.
It is not a de Polignac number, because 5061060050565 - 220 = 5061059001989 is a prime.
It is a super-2 number, since 2×50610600505652 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7334869294 + ... + 7334869983.
It is an arithmetic number, because the mean of its divisors is an integer number (528110614008).
Almost surely, 25061060050565 is an apocalyptic number.
It is an amenable number.
5061060050565 is a deficient number, since it is larger than the sum of its proper divisors (3388709773563).
5061060050565 is a wasteful number, since it uses less digits than its factorization.
5061060050565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14669739308.
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 5061060050565 in words is "five trillion, sixty-one billion, sixty million, fifty thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •