Base | Representation |
---|---|
bin | 10000000010001010011… |
… | …00010001111000000000 |
3 | 1221200000022220002000000 |
4 | 20001011030101320000 |
5 | 33011234131120421 |
6 | 1101030532000000 |
7 | 54542141231361 |
oct | 10010514217000 |
9 | 1850008802000 |
10 | 550916660736 |
11 | 1a2708102302 |
12 | 8a930a60000 |
13 | 3cc49a986b0 |
14 | 1c9435a9b68 |
15 | e4e5be6226 |
hex | 8045311e00 |
550916660736 has 280 divisors, whose sum is σ = 1777349028840. Its totient is φ = 169511325696.
The previous prime is 550916660729. The next prime is 550916660779. The reversal of 550916660736 is 637066619055.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
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 27 ways as a sum of consecutive naturals, for example, 4795455 + ... + 4908993.
It is an arithmetic number, because the mean of its divisors is an integer number (6347675103).
Almost surely, 2550916660736 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 550916660736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (888674514420).
550916660736 is an abundant number, since it is smaller than the sum of its proper divisors (1226432368104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550916660736 is an equidigital number, since it uses as much as digits as its factorization.
550916660736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113588 (or 113557 counting only the distinct ones).
The product of its (nonzero) digits is 6123600, while the sum is 54.
The spelling of 550916660736 in words is "five hundred fifty billion, nine hundred sixteen million, six hundred sixty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •