Base | Representation |
---|---|
bin | 100100110100100011100… |
… | …1001001010110011010101 |
3 | 122220210110110010111202012 |
4 | 1021221013021022303111 |
5 | 1130403220223414230 |
6 | 14432500515154005 |
7 | 1031422666161002 |
oct | 111510711126325 |
9 | 18823413114665 |
10 | 5060665060565 |
11 | 168124154a454 |
12 | 69895a5a5905 |
13 | 2a92ac5494ca |
14 | 136d1a6ba8a9 |
15 | 8b98d544395 |
hex | 49a4724acd5 |
5060665060565 has 4 divisors (see below), whose sum is σ = 6072798072684. Its totient is φ = 4048532048448.
The previous prime is 5060665060553. The next prime is 5060665060621. The reversal of 5060665060565 is 5650605660605.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 518621783716 + 4542043276849 = 720154^2 + 2131207^2 .
It is a cyclic number.
It is not a de Polignac number, because 5060665060565 - 230 = 5059591318741 is a prime.
It is a super-2 number, since 2×50606650605652 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
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 3 ways as a sum of consecutive naturals, for example, 506066506052 + ... + 506066506061.
It is an arithmetic number, because the mean of its divisors is an integer number (1518199518171).
Almost surely, 25060665060565 is an apocalyptic number.
It is an amenable number.
5060665060565 is a deficient number, since it is larger than the sum of its proper divisors (1012133012119).
5060665060565 is a wasteful number, since it uses less digits than its factorization.
5060665060565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1012133012118.
The product of its (nonzero) digits is 4860000, while the sum is 50.
The spelling of 5060665060565 in words is "five trillion, sixty billion, six hundred sixty-five million, sixty thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.559 sec. • engine limits •