Base | Representation |
---|---|
bin | 1110101101001110110… |
… | …11000001011110101011 |
3 | 1210022022121211101111121 |
4 | 13112213123001132223 |
5 | 31234343413141101 |
6 | 1024050230240111 |
7 | 51336205402051 |
oct | 7264733013653 |
9 | 1708277741447 |
10 | 505320052651 |
11 | 185339aa5827 |
12 | 81b267b6037 |
13 | 388613a881b |
14 | 1a6599d81d1 |
15 | d227c0a0a1 |
hex | 75a76c17ab |
505320052651 has 4 divisors (see below), whose sum is σ = 505472582392. Its totient is φ = 505167522912.
The previous prime is 505320052637. The next prime is 505320052661. The reversal of 505320052651 is 156250023505.
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 505320052651 - 213 = 505320044459 is a prime.
It is a super-2 number, since 2×5053200526512 (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 (505320052621) 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 3 ways as a sum of consecutive naturals, for example, 76259901 + ... + 76266526.
It is an arithmetic number, because the mean of its divisors is an integer number (126368145598).
Almost surely, 2505320052651 is an apocalyptic number.
505320052651 is a deficient number, since it is larger than the sum of its proper divisors (152529741).
505320052651 is a wasteful number, since it uses less digits than its factorization.
505320052651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152529740.
The product of its (nonzero) digits is 45000, while the sum is 34.
The spelling of 505320052651 in words is "five hundred five billion, three hundred twenty million, fifty-two thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •