Base | Representation |
---|---|
bin | 1110101101010010100… |
… | …10110001101000111011 |
3 | 1210022101210220021210002 |
4 | 13112221102301220323 |
5 | 31234424432220201 |
6 | 1024053311143215 |
7 | 51340036260065 |
oct | 7265122615073 |
9 | 1708353807702 |
10 | 505351445051 |
11 | 185355797362 |
12 | 81b35214b0b |
13 | 38867a4a4cb |
14 | 1a65dc4a735 |
15 | d22a85b76b |
hex | 75a94b1a3b |
505351445051 has 4 divisors (see below), whose sum is σ = 505789738872. Its totient is φ = 504913151232.
The previous prime is 505351445033. The next prime is 505351445119. The reversal of 505351445051 is 150544153505.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 150544153505 = 5 ⋅30108830701.
It is a cyclic number.
It is not a de Polignac number, because 505351445051 - 214 = 505351428667 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505351444996 and 505351445014.
It is not an unprimeable number, because it can be changed into a prime (505351441051) 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, 219145181 + ... + 219147486.
It is an arithmetic number, because the mean of its divisors is an integer number (126447434718).
Almost surely, 2505351445051 is an apocalyptic number.
505351445051 is a deficient number, since it is larger than the sum of its proper divisors (438293821).
505351445051 is a wasteful number, since it uses less digits than its factorization.
505351445051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438293820.
The product of its (nonzero) digits is 150000, while the sum is 38.
Adding to 505351445051 its reverse (150544153505), we get a palindrome (655895598556).
The spelling of 505351445051 in words is "five hundred five billion, three hundred fifty-one million, four hundred forty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •