Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …01101110010010000001 |
3 | 1221200111010220002222100 |
4 | 20001100021232102001 |
5 | 33012123214240113 |
6 | 1101101101101013 |
7 | 54546533204541 |
oct | 10012011562201 |
9 | 1850433802870 |
10 | 551100540033 |
11 | 1a27a198456a |
12 | 8a982557769 |
13 | 3cc78bca204 |
14 | 1c95db93321 |
15 | e506e18d73 |
hex | 805026e481 |
551100540033 has 6 divisors (see below), whose sum is σ = 796034113394. Its totient is φ = 367400360016.
The previous prime is 551100539999. The next prime is 551100540049. The reversal of 551100540033 is 330045001155.
551100540033 is a `hidden beast` number, since 5 + 5 + 110 + 0 + 540 + 0 + 3 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 526505518449 + 24595021584 = 725607^2 + 156828^2 .
It is not a de Polignac number, because 551100540033 - 232 = 546805572737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 551100539979 and 551100540006.
It is not an unprimeable number, because it can be changed into a prime (551100545033) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 30616696660 + ... + 30616696677.
Almost surely, 2551100540033 is an apocalyptic number.
It is an amenable number.
551100540033 is a deficient number, since it is larger than the sum of its proper divisors (244933573361).
551100540033 is a wasteful number, since it uses less digits than its factorization.
551100540033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61233393343 (or 61233393340 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 551100540033 its reverse (330045001155), we get a palindrome (881145541188).
The spelling of 551100540033 in words is "five hundred fifty-one billion, one hundred million, five hundred forty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •