Base | Representation |
---|---|
bin | 11001010000110100111110… |
… | …00011101011111111111001 |
3 | 21021200220000010200002222112 |
4 | 30220122133003223333321 |
5 | 24240143113020103312 |
6 | 314053015133502105 |
7 | 14462425226614262 |
oct | 1450323703537771 |
9 | 237626003602875 |
10 | 55553775550457 |
11 | 16779251018028 |
12 | 629283b041935 |
13 | 24cc91095b642 |
14 | da0b6210d969 |
15 | 665134045d22 |
hex | 32869f0ebff9 |
55553775550457 has 8 divisors (see below), whose sum is σ = 56921411965320. Its totient is φ = 54186742291840.
The previous prime is 55553775550453. The next prime is 55553775550529. The reversal of 55553775550457 is 75405557735555.
It can be written as a sum of positive squares in 4 ways, for example, as 2352346117696 + 53201429432761 = 1533736^2 + 7293931^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 55553775550457 - 22 = 55553775550453 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55553775550453) 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, 150602582 + ... + 150971007.
It is an arithmetic number, because the mean of its divisors is an integer number (7115176495665).
Almost surely, 255553775550457 is an apocalyptic number.
It is an amenable number.
55553775550457 is a deficient number, since it is larger than the sum of its proper divisors (1367636414863).
55553775550457 is a wasteful number, since it uses less digits than its factorization.
55553775550457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 301578123.
The product of its (nonzero) digits is 1607812500, while the sum is 68.
The spelling of 55553775550457 in words is "fifty-five trillion, five hundred fifty-three billion, seven hundred seventy-five million, five hundred fifty thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •