Base | Representation |
---|---|
bin | 1110101101010010100… |
… | …10110011000110000011 |
3 | 1210022101210220120221211 |
4 | 13112221102303012003 |
5 | 31234424432413021 |
6 | 1024053311230551 |
7 | 51340036313341 |
oct | 7265122630603 |
9 | 1708353816854 |
10 | 505351451011 |
11 | 1853557a0890 |
12 | 81b35218457 |
13 | 38867a50134 |
14 | 1a65dc4c991 |
15 | d22a85d3e1 |
hex | 75a94b3183 |
505351451011 has 4 divisors (see below), whose sum is σ = 551292492024. Its totient is φ = 459410410000.
The previous prime is 505351451009. The next prime is 505351451047. The reversal of 505351451011 is 110154153505.
It is a happy number.
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 505351451011 - 21 = 505351451009 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505351451071) 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 3 ways as a sum of consecutive naturals, for example, 22970520490 + ... + 22970520511.
It is an arithmetic number, because the mean of its divisors is an integer number (137823123006).
Almost surely, 2505351451011 is an apocalyptic number.
505351451011 is a deficient number, since it is larger than the sum of its proper divisors (45941041013).
505351451011 is a wasteful number, since it uses less digits than its factorization.
505351451011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45941041012.
The product of its (nonzero) digits is 7500, while the sum is 31.
The spelling of 505351451011 in words is "five hundred five billion, three hundred fifty-one million, four hundred fifty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •