Base | Representation |
---|---|
bin | 10000000000100011110… |
… | …10000010100011000110 |
3 | 1221120210100212020111100 |
4 | 20000101322002203012 |
5 | 33003003344210400 |
6 | 1100405314120530 |
7 | 54511622623140 |
oct | 10002172024306 |
9 | 1846710766440 |
10 | 550056241350 |
11 | 1a2306454500 |
12 | 8a730880146 |
13 | 3cb4074c9b5 |
14 | 1c8a11d3c90 |
15 | e4953d7100 |
hex | 8011e828c6 |
550056241350 has 432 divisors, whose sum is σ = 1859667473664. Its totient is φ = 114098371200.
The previous prime is 550056241307. The next prime is 550056241369. The reversal of 550056241350 is 53142650055.
550056241350 is a `hidden beast` number, since 5 + 5 + 0 + 0 + 562 + 41 + 3 + 50 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 338079237 + ... + 338080863.
Almost surely, 2550056241350 is an apocalyptic number.
550056241350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 550056241350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (929833736832).
550056241350 is an abundant number, since it is smaller than the sum of its proper divisors (1309611232314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550056241350 is a wasteful number, since it uses less digits than its factorization.
550056241350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2561 (or 2542 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The spelling of 550056241350 in words is "five hundred fifty billion, fifty-six million, two hundred forty-one thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •