Base | Representation |
---|---|
bin | 10000001001110111000… |
… | …11111010000111010001 |
3 | 1222001200101121000010022 |
4 | 20010323203322013101 |
5 | 33043220303100001 |
6 | 1102553024513225 |
7 | 55046441403056 |
oct | 10047343720721 |
9 | 1861611530108 |
10 | 555050050001 |
11 | 1a4439312897 |
12 | 8b6a517b815 |
13 | 40458221465 |
14 | 1cc1652302d |
15 | e688a1911b |
hex | 813b8fa1d1 |
555050050001 has 4 divisors (see below), whose sum is σ = 555986054052. Its totient is φ = 554114045952.
The previous prime is 555050049979. The next prime is 555050050043. The reversal of 555050050001 is 100050050555.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 109180019776 + 445870030225 = 330424^2 + 667735^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-555050050001 is a prime.
It is a super-2 number, since 2×5550500500012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (555050650001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 468001136 + ... + 468002321.
It is an arithmetic number, because the mean of its divisors is an integer number (138996513513).
Almost surely, 2555050050001 is an apocalyptic number.
It is an amenable number.
555050050001 is a deficient number, since it is larger than the sum of its proper divisors (936004051).
555050050001 is an equidigital number, since it uses as much as digits as its factorization.
555050050001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936004050.
The product of its (nonzero) digits is 3125, while the sum is 26.
The spelling of 555050050001 in words is "five hundred fifty-five billion, fifty million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •