Base | Representation |
---|---|
bin | 1110101100101010000… |
… | …00111011011010010001 |
3 | 1210021112002201011201022 |
4 | 13112111000323122101 |
5 | 31233230333102121 |
6 | 1023555435045225 |
7 | 51325435363445 |
oct | 7262500733221 |
9 | 1707462634638 |
10 | 505011222161 |
11 | 1851a073a916 |
12 | 81a5b2a0815 |
13 | 388124085a4 |
14 | 1a62a9a6825 |
15 | d20aa54aab |
hex | 759503b691 |
505011222161 has 8 divisors (see below), whose sum is σ = 517297952160. Its totient is φ = 492749141472.
The previous prime is 505011222139. The next prime is 505011222167. The reversal of 505011222161 is 161222110505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 505011222161 - 26 = 505011222097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 505011222161.
It is not an unprimeable number, because it can be changed into a prime (505011222167) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6120851 + ... + 6202808.
It is an arithmetic number, because the mean of its divisors is an integer number (64662244020).
Almost surely, 2505011222161 is an apocalyptic number.
It is an amenable number.
505011222161 is a deficient number, since it is larger than the sum of its proper divisors (12286729999).
505011222161 is a wasteful number, since it uses less digits than its factorization.
505011222161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12324655.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 505011222161 its reverse (161222110505), we get a palindrome (666233332666).
The spelling of 505011222161 in words is "five hundred five billion, eleven million, two hundred twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •