Base | Representation |
---|---|
bin | 10000000010100000111… |
… | …10111011111101000101 |
3 | 1221200111112100122021100 |
4 | 20001100132323331011 |
5 | 33012131130213221 |
6 | 1101101420210313 |
7 | 54546631365465 |
oct | 10012036737505 |
9 | 1850445318240 |
10 | 551106101061 |
11 | 1a27a503265a |
12 | 8a984399999 |
13 | 3cc7a0c6469 |
14 | 1c9607ddba5 |
15 | e507666926 |
hex | 80507bbf45 |
551106101061 has 12 divisors (see below), whose sum is σ = 815457808620. Its totient is φ = 358442992320.
The previous prime is 551106101033. The next prime is 551106101081. The reversal of 551106101061 is 160101601155.
551106101061 is a `hidden beast` number, since 551 + 1 + 0 + 6 + 1 + 0 + 106 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 7338492225 + 543767608836 = 85665^2 + 737406^2 .
It is not a de Polignac number, because 551106101061 - 219 = 551105576773 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551106101081) 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 11 ways as a sum of consecutive naturals, for example, 746755866 + ... + 746756603.
It is an arithmetic number, because the mean of its divisors is an integer number (67954817385).
Almost surely, 2551106101061 is an apocalyptic number.
It is an amenable number.
551106101061 is a deficient number, since it is larger than the sum of its proper divisors (264351707559).
551106101061 is a wasteful number, since it uses less digits than its factorization.
551106101061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493512516 (or 1493512513 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 551106101061 in words is "five hundred fifty-one billion, one hundred six million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •