Base | Representation |
---|---|
bin | 1110101100110111001… |
… | …01011001000100100011 |
3 | 1210021210210010000211111 |
4 | 13112123211121010203 |
5 | 31233442042203011 |
6 | 1024014413324151 |
7 | 51331244301343 |
oct | 7263345310443 |
9 | 1707723100744 |
10 | 505121444131 |
11 | 185247983257 |
12 | 81a90196657 |
13 | 3882c1ba9a5 |
14 | 1a63b498d23 |
15 | d215578121 |
hex | 759b959123 |
505121444131 has 4 divisors (see below), whose sum is σ = 513682824600. Its totient is φ = 496560063664.
The previous prime is 505121444119. The next prime is 505121444141. The reversal of 505121444131 is 131444121505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 505121444131 - 215 = 505121411363 is a prime.
It is a super-2 number, since 2×5051214441312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505121444093 and 505121444102.
It is not an unprimeable number, because it can be changed into a prime (505121444141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4280690146 + ... + 4280690263.
It is an arithmetic number, because the mean of its divisors is an integer number (128420706150).
Almost surely, 2505121444131 is an apocalyptic number.
505121444131 is a deficient number, since it is larger than the sum of its proper divisors (8561380469).
505121444131 is an equidigital number, since it uses as much as digits as its factorization.
505121444131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8561380468.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 505121444131 its reverse (131444121505), we get a palindrome (636565565636).
The spelling of 505121444131 in words is "five hundred five billion, one hundred twenty-one million, four hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •