Base | Representation |
---|---|
bin | 10000000010011000011… |
… | …10010010000001000001 |
3 | 1221200022112212100002001 |
4 | 20001030032102001001 |
5 | 33012004331013423 |
6 | 1101050344224001 |
7 | 54545103016636 |
oct | 10011416220101 |
9 | 1850275770061 |
10 | 551034626113 |
11 | 1a2768754454 |
12 | 8a96446b001 |
13 | 3cc6835c4aa |
14 | 1c95511618d |
15 | e501248cad |
hex | 804c392041 |
551034626113 has 4 divisors (see below), whose sum is σ = 580036448560. Its totient is φ = 522032803668.
The previous prime is 551034626111. The next prime is 551034626123. The reversal of 551034626113 is 311626430155.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 311626430155 = 5 ⋅62325286031.
It is a cyclic number.
It is not a de Polignac number, because 551034626113 - 21 = 551034626111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (551034626111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14500911195 + ... + 14500911232.
It is an arithmetic number, because the mean of its divisors is an integer number (145009112140).
Almost surely, 2551034626113 is an apocalyptic number.
It is an amenable number.
551034626113 is a deficient number, since it is larger than the sum of its proper divisors (29001822447).
551034626113 is a wasteful number, since it uses less digits than its factorization.
551034626113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29001822446.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 551034626113 in words is "five hundred fifty-one billion, thirty-four million, six hundred twenty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •