Base | Representation |
---|---|
bin | 10000000001001010011… |
… | …11111100100100111000 |
3 | 1221121121222111001021012 |
4 | 20000211033330210320 |
5 | 33004134433014120 |
6 | 1100501425333052 |
7 | 54522643123652 |
oct | 10004517744470 |
9 | 1847558431235 |
10 | 550380751160 |
11 | 1a2462649529 |
12 | 8a801497188 |
13 | 3cb92a4c836 |
14 | 1c8d23476d2 |
15 | e4b3b381c5 |
hex | 80253fc938 |
550380751160 has 128 divisors (see below), whose sum is σ = 1281352141440. Its totient is φ = 212627251200.
The previous prime is 550380751153. The next prime is 550380751181. The reversal of 550380751160 is 61157083055.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 72348077 + ... + 72355683.
It is an arithmetic number, because the mean of its divisors is an integer number (10010563605).
Almost surely, 2550380751160 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 550380751160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (640676070720).
550380751160 is an abundant number, since it is smaller than the sum of its proper divisors (730971390280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550380751160 is a wasteful number, since it uses less digits than its factorization.
550380751160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8097 (or 8093 counting only the distinct ones).
The product of its (nonzero) digits is 126000, while the sum is 41.
The spelling of 550380751160 in words is "five hundred fifty billion, three hundred eighty million, seven hundred fifty-one thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •