Base | Representation |
---|---|
bin | 101000011010110011001… |
… | …1000110101011011011101 |
3 | 201200001201012110022102121 |
4 | 1100311212120311123131 |
5 | 1212003331242000221 |
6 | 15451552121022541 |
7 | 1112225550105403 |
oct | 120654630653335 |
9 | 21601635408377 |
10 | 5555110500061 |
11 | 1851a00068381 |
12 | 75874b324a51 |
13 | 313ac998c495 |
14 | 152c23d23473 |
15 | 9977b6cba41 |
hex | 50d666356dd |
5555110500061 has 8 divisors (see below), whose sum is σ = 5615694896504. Its totient is φ = 5494593761280.
The previous prime is 5555110500047. The next prime is 5555110500073. The reversal of 5555110500061 is 1600050115555.
It can be written as a sum of positive squares in 4 ways, for example, as 1956065176836 + 3599045323225 = 1398594^2 + 1897115^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5555110500061 - 211 = 5555110498013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5555110500031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16749300 + ... + 17077741.
It is an arithmetic number, because the mean of its divisors is an integer number (701961862063).
Almost surely, 25555110500061 is an apocalyptic number.
It is an amenable number.
5555110500061 is a deficient number, since it is larger than the sum of its proper divisors (60584396443).
5555110500061 is a wasteful number, since it uses less digits than its factorization.
5555110500061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33828831.
The product of its (nonzero) digits is 18750, while the sum is 34.
The spelling of 5555110500061 in words is "five trillion, five hundred fifty-five billion, one hundred ten million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •