Base | Representation |
---|---|
bin | 10000000011010010111… |
… | …11000000101110100101 |
3 | 1221201120202121220102202 |
4 | 20001221133000232211 |
5 | 33014011020113023 |
6 | 1101211202344245 |
7 | 54563213555603 |
oct | 10015137005645 |
9 | 1851522556382 |
10 | 551525551013 |
11 | 1a299a882608 |
12 | 8aa8095b085 |
13 | 40015c879b8 |
14 | 1c9a03c8873 |
15 | e52e3bd128 |
hex | 80697c0ba5 |
551525551013 has 4 divisors (see below), whose sum is σ = 555551285100. Its totient is φ = 547499816928.
The previous prime is 551525550911. The next prime is 551525551037. The reversal of 551525551013 is 310155525155.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 112669649569 + 438855901444 = 335663^2 + 662462^2 .
It is a cyclic number.
It is not a de Polignac number, because 551525551013 - 214 = 551525534629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551521551013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2012866838 + ... + 2012867111.
It is an arithmetic number, because the mean of its divisors is an integer number (138887821275).
Almost surely, 2551525551013 is an apocalyptic number.
It is an amenable number.
551525551013 is a deficient number, since it is larger than the sum of its proper divisors (4025734087).
551525551013 is a wasteful number, since it uses less digits than its factorization.
551525551013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4025734086.
The product of its (nonzero) digits is 93750, while the sum is 38.
The spelling of 551525551013 in words is "five hundred fifty-one billion, five hundred twenty-five million, five hundred fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •