Base | Representation |
---|---|
bin | 10000000100011011001… |
… | …10100001111111100011 |
3 | 1221210010222211101222210 |
4 | 20002031212201333203 |
5 | 33021231131031201 |
6 | 1101351250133203 |
7 | 54614222221653 |
oct | 10021546417743 |
9 | 1853128741883 |
10 | 552131502051 |
11 | 1a3180925598 |
12 | 8b00b881203 |
13 | 400b16881cc |
14 | 1ca1aa80363 |
15 | e5676b41d6 |
hex | 808d9a1fe3 |
552131502051 has 4 divisors (see below), whose sum is σ = 736175336072. Its totient is φ = 368087668032.
The previous prime is 552131502011. The next prime is 552131502103. The reversal of 552131502051 is 150205131255.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 552131502051 - 219 = 552130977763 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (552131502001) 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, 92021917006 + ... + 92021917011.
It is an arithmetic number, because the mean of its divisors is an integer number (184043834018).
Almost surely, 2552131502051 is an apocalyptic number.
552131502051 is a deficient number, since it is larger than the sum of its proper divisors (184043834021).
552131502051 is a wasteful number, since it uses less digits than its factorization.
552131502051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184043834020.
The product of its (nonzero) digits is 7500, while the sum is 30.
The spelling of 552131502051 in words is "five hundred fifty-two billion, one hundred thirty-one million, five hundred two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •