Base | Representation |
---|---|
bin | 101000011000011100101… |
… | …1000101000011111011101 |
3 | 201122120200020222222121110 |
4 | 1100300321120220133131 |
5 | 1211413010442130203 |
6 | 15445355042052233 |
7 | 1111656446624031 |
oct | 120607130503735 |
9 | 21576606888543 |
10 | 5550060505053 |
11 | 184a849513389 |
12 | 75778004a079 |
13 | 3134a367785c |
14 | 1528a536a1c1 |
15 | 9958319bd03 |
hex | 50c396287dd |
5550060505053 has 8 divisors (see below), whose sum is σ = 7400899031008. Its totient is φ = 3699631157904.
The previous prime is 5550060505049. The next prime is 5550060505057. The reversal of 5550060505053 is 3505050600555.
It is an interprime number because it is at equal distance from previous prime (5550060505049) and next prime (5550060505057).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5550060505053 - 22 = 5550060505049 is a prime.
It is a super-2 number, since 2×55500605050532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5550060505057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102263050 + ... + 102317307.
It is an arithmetic number, because the mean of its divisors is an integer number (925112378876).
Almost surely, 25550060505053 is an apocalyptic number.
It is an amenable number.
5550060505053 is a deficient number, since it is larger than the sum of its proper divisors (1850838525955).
5550060505053 is a wasteful number, since it uses less digits than its factorization.
5550060505053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204589403.
The product of its (nonzero) digits is 281250, while the sum is 39.
The spelling of 5550060505053 in words is "five trillion, five hundred fifty billion, sixty million, five hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •