Base | Representation |
---|---|
bin | 1110101101000110110… |
… | …01010110010111111001 |
3 | 1210022010220201121122202 |
4 | 13112203121112113321 |
5 | 31234224120130311 |
6 | 1024035414355545 |
7 | 51334425301262 |
oct | 7264331262771 |
9 | 1708126647582 |
10 | 505252505081 |
11 | 18530495a295 |
12 | 81b0805bbb5 |
13 | 388503b834c |
14 | 1a650a53969 |
15 | d221d15e3b |
hex | 75a36565f9 |
505252505081 has 8 divisors (see below), whose sum is σ = 540167157504. Its totient is φ = 470914954560.
The previous prime is 505252505039. The next prime is 505252505099. The reversal of 505252505081 is 180505252505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 505252505081 - 226 = 505185396217 is a prime.
It is a super-2 number, since 2×5052525050812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505252505281) 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 7 ways as a sum of consecutive naturals, for example, 144273665 + ... + 144277166.
It is an arithmetic number, because the mean of its divisors is an integer number (67520894688).
Almost surely, 2505252505081 is an apocalyptic number.
It is an amenable number.
505252505081 is a deficient number, since it is larger than the sum of its proper divisors (34914652423).
505252505081 is a wasteful number, since it uses less digits than its factorization.
505252505081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288550951.
The product of its (nonzero) digits is 100000, while the sum is 38.
Adding to 505252505081 its reverse (180505252505), we get a palindrome (685757757586).
The spelling of 505252505081 in words is "five hundred five billion, two hundred fifty-two million, five hundred five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •