Base | Representation |
---|---|
bin | 11001000010100111010110… |
… | …11110010111110101111101 |
3 | 21012222012111120212222111011 |
4 | 30201103223132113311331 |
5 | 24204143000410424321 |
6 | 313040413202355221 |
7 | 14412226502416531 |
oct | 1441235336276575 |
9 | 235865446788434 |
10 | 55065431342461 |
11 | 16600133492691 |
12 | 621407165bb11 |
13 | 2495856569617 |
14 | d85276d07bc1 |
15 | 6575a1840ae1 |
hex | 3214eb797d7d |
55065431342461 has 4 divisors (see below), whose sum is σ = 55093918375612. Its totient is φ = 55036944309312.
The previous prime is 55065431342459. The next prime is 55065431342491. The reversal of 55065431342461 is 16424313456055.
It is a happy number.
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 35447662994436 + 19617768348025 = 5953794^2 + 4429195^2 .
It is a cyclic number.
It is not a de Polignac number, because 55065431342461 - 21 = 55065431342459 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 (55065431342491) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14243513676 + ... + 14243517541.
It is an arithmetic number, because the mean of its divisors is an integer number (13773479593903).
Almost surely, 255065431342461 is an apocalyptic number.
It is an amenable number.
55065431342461 is a deficient number, since it is larger than the sum of its proper divisors (28487033151).
55065431342461 is a wasteful number, since it uses less digits than its factorization.
55065431342461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28487033150.
The product of its (nonzero) digits is 5184000, while the sum is 49.
The spelling of 55065431342461 in words is "fifty-five trillion, sixty-five billion, four hundred thirty-one million, three hundred forty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •