Base | Representation |
---|---|
bin | 1110101100111010101… |
… | …10111001101110000011 |
3 | 1210021212212002210101120 |
4 | 13112131112321232003 |
5 | 31234022201401011 |
6 | 1024021355203323 |
7 | 51332055232464 |
oct | 7263526715603 |
9 | 1707785083346 |
10 | 505151200131 |
11 | 185262757396 |
12 | 81a9a146543 |
13 | 388354088a6 |
14 | 1a641402d6b |
15 | d217ea4a06 |
hex | 759d5b9b83 |
505151200131 has 16 divisors (see below), whose sum is σ = 688813800960. Its totient is φ = 329212447200.
The previous prime is 505151200027. The next prime is 505151200133. The reversal of 505151200131 is 131002151505.
It is not a de Polignac number, because 505151200131 - 221 = 505149102979 is a prime.
It is a super-2 number, since 2×5051512001312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (505151200133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10527745 + ... + 10575618.
It is an arithmetic number, because the mean of its divisors is an integer number (43050862560).
Almost surely, 2505151200131 is an apocalyptic number.
505151200131 is a deficient number, since it is larger than the sum of its proper divisors (183662600829).
505151200131 is a wasteful number, since it uses less digits than its factorization.
505151200131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21103546.
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 505151200131 its reverse (131002151505), we get a palindrome (636153351636).
The spelling of 505151200131 in words is "five hundred five billion, one hundred fifty-one million, two hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •