Base | Representation |
---|---|
bin | 1110101100101111111… |
… | …01001001000001101101 |
3 | 1210021122112112211212220 |
4 | 13112113331021001231 |
5 | 31233331000423010 |
6 | 1024004400345553 |
7 | 51326604635460 |
oct | 7262775110155 |
9 | 1707575484786 |
10 | 505060561005 |
11 | 185216579920 |
12 | 81a739152b9 |
13 | 3881c6c1a80 |
14 | 1a63336b2d7 |
15 | d21004d970 |
hex | 7597f4906d |
505060561005 has 256 divisors, whose sum is σ = 1150899757056. Its totient is φ = 182022635520.
The previous prime is 505060560967. The next prime is 505060561009. The reversal of 505060561005 is 500165060505.
It is not a de Polignac number, because 505060561005 - 213 = 505060552813 is a prime.
It is a super-2 number, since 2×5050605610052 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505060561009) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 174337717 + ... + 174340613.
It is an arithmetic number, because the mean of its divisors is an integer number (4495702176).
Almost surely, 2505060561005 is an apocalyptic number.
505060561005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
505060561005 is an abundant number, since it is smaller than the sum of its proper divisors (645839196051).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505060561005 is a wasteful number, since it uses less digits than its factorization.
505060561005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3636.
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 505060561005 in words is "five hundred five billion, sixty million, five hundred sixty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •