Base | Representation |
---|---|
bin | 10000000000011111000… |
… | …00111101001000101111 |
3 | 1221120200120100102012200 |
4 | 20000033200331020233 |
5 | 33002413111024101 |
6 | 1100401322032543 |
7 | 54510624543363 |
oct | 10001740751057 |
9 | 1846616312180 |
10 | 550016111151 |
11 | 1a2295835051 |
12 | 8a71b348753 |
13 | 3cb3533bb10 |
14 | 1c899b492a3 |
15 | e491b0b986 |
hex | 800f83d22f |
550016111151 has 48 divisors (see below), whose sum is σ = 858762777600. Its totient is φ = 337214869056.
The previous prime is 550016111131. The next prime is 550016111153. The reversal of 550016111151 is 151111610055.
550016111151 is a `hidden beast` number, since 5 + 500 + 1 + 6 + 1 + 1 + 1 + 151 = 666.
It is not a de Polignac number, because 550016111151 - 25 = 550016111119 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550016111153) 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 47 ways as a sum of consecutive naturals, for example, 37259110 + ... + 37273868.
It is an arithmetic number, because the mean of its divisors is an integer number (17890891200).
Almost surely, 2550016111151 is an apocalyptic number.
550016111151 is a deficient number, since it is larger than the sum of its proper divisors (308746666449).
550016111151 is a wasteful number, since it uses less digits than its factorization.
550016111151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15940 (or 15937 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
The spelling of 550016111151 in words is "five hundred fifty billion, sixteen million, one hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •