Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …10110001111001001010 |
3 | 1221120122210112201002110 |
4 | 20000032312301321022 |
5 | 33002402243230200 |
6 | 1100400245043150 |
7 | 54510431555013 |
oct | 10001666617112 |
9 | 1846583481073 |
10 | 550005055050 |
11 | 1a228a573480 |
12 | 8a7176b64b6 |
13 | 3cb32c6a649 |
14 | 1c8984ac00a |
15 | e490b75b50 |
hex | 800edb1e4a |
550005055050 has 96 divisors (see below), whose sum is σ = 1536014260224. Its totient is φ = 129033432000.
The previous prime is 550005055021. The next prime is 550005055051. The reversal of 550005055050 is 50550500055.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 550005054999 and 550005055017.
It is not an unprimeable number, because it can be changed into a prime (550005055051) 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, 5325244 + ... + 5427543.
It is an arithmetic number, because the mean of its divisors is an integer number (16000148544).
Almost surely, 2550005055050 is an apocalyptic number.
550005055050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
550005055050 is an abundant number, since it is smaller than the sum of its proper divisors (986009205174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550005055050 is a wasteful number, since it uses less digits than its factorization.
550005055050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10752844 (or 10752839 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 30.
The spelling of 550005055050 in words is "five hundred fifty billion, five million, fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •