Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …10110000101010010001 |
3 | 1221120122210112110011110 |
4 | 20000032312300222101 |
5 | 33002402243100001 |
6 | 1100400245003533 |
7 | 54510431534211 |
oct | 10001666605221 |
9 | 1846583473143 |
10 | 550005050001 |
11 | 1a228a56a700 |
12 | 8a7176b35a9 |
13 | 3cb32c68264 |
14 | 1c8984aa241 |
15 | e490b743d6 |
hex | 800edb0a91 |
550005050001 has 48 divisors (see below), whose sum is σ = 808611842304. Its totient is φ = 332286240000.
The previous prime is 550005049973. The next prime is 550005050027. The reversal of 550005050001 is 100050500055.
It is not a de Polignac number, because 550005050001 - 211 = 550005047953 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 550005050001.
It is not an unprimeable number, because it can be changed into a prime (550005050051) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 233943976 + ... + 233946326.
It is an arithmetic number, because the mean of its divisors is an integer number (16846080048).
Almost surely, 2550005050001 is an apocalyptic number.
It is an amenable number.
550005050001 is a deficient number, since it is larger than the sum of its proper divisors (258606792303).
550005050001 is a wasteful number, since it uses less digits than its factorization.
550005050001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4134 (or 4123 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 21.
Adding to 550005050001 its reverse (100050500055), we get a palindrome (650055550056).
The spelling of 550005050001 in words is "five hundred fifty billion, five million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •