Base | Representation |
---|---|
bin | 110010110011011101… |
… | …011101000011110101 |
3 | 12012210201022000002122 |
4 | 302303131131003311 |
5 | 1343204403403141 |
6 | 41020553245325 |
7 | 3640545115025 |
oct | 626335350365 |
9 | 165721260078 |
10 | 54550450421 |
11 | 21153341885 |
12 | a6a4a03845 |
13 | 51b472b93c |
14 | 28d6c0da85 |
15 | 16440eb64b |
hex | cb375d0f5 |
54550450421 has 4 divisors (see below), whose sum is σ = 54552572844. Its totient is φ = 54548328000.
The previous prime is 54550450387. The next prime is 54550450429. The reversal of 54550450421 is 12405405545.
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 53051908900 + 1498541521 = 230330^2 + 38711^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54550450421 is a prime.
It is a super-2 number, since 2×545504504212 (a number of 22 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 (54550450429) 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, 1022180 + ... + 1074221.
It is an arithmetic number, because the mean of its divisors is an integer number (13638143211).
Almost surely, 254550450421 is an apocalyptic number.
It is an amenable number.
54550450421 is a deficient number, since it is larger than the sum of its proper divisors (2122423).
54550450421 is a wasteful number, since it uses less digits than its factorization.
54550450421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2122422.
The product of its (nonzero) digits is 80000, while the sum is 35.
Adding to 54550450421 its reverse (12405405545), we get a palindrome (66955855966).
The spelling of 54550450421 in words is "fifty-four billion, five hundred fifty million, four hundred fifty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •