Base | Representation |
---|---|
bin | 101000011101001001111… |
… | …0000001010001110000001 |
3 | 201200112202120022121000212 |
4 | 1100322103300022032001 |
5 | 1212044210114302140 |
6 | 15454145533523505 |
7 | 1112465052634016 |
oct | 120722360121601 |
9 | 21615676277025 |
10 | 5560166556545 |
11 | 1854065082457 |
12 | 759720643595 |
13 | 314424317093 |
14 | 15318361770d |
15 | 99975507765 |
hex | 50e93c0a381 |
5560166556545 has 8 divisors (see below), whose sum is σ = 6672658179240. Its totient is φ = 4447827704320.
The previous prime is 5560166556487. The next prime is 5560166556547. The reversal of 5560166556545 is 5456556610655.
It can be written as a sum of positive squares in 4 ways, for example, as 2796951863281 + 2763214693264 = 1672409^2 + 1662292^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5560166556545 - 212 = 5560166552449 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5560166556547) 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 7 ways as a sum of consecutive naturals, for example, 38112530 + ... + 38258139.
It is an arithmetic number, because the mean of its divisors is an integer number (834082272405).
Almost surely, 25560166556545 is an apocalyptic number.
It is an amenable number.
5560166556545 is a deficient number, since it is larger than the sum of its proper divisors (1112491622695).
5560166556545 is a wasteful number, since it uses less digits than its factorization.
5560166556545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76385235.
The product of its (nonzero) digits is 81000000, while the sum is 59.
The spelling of 5560166556545 in words is "five trillion, five hundred sixty billion, one hundred sixty-six million, five hundred fifty-six thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •