Base | Representation |
---|---|
bin | 101111000101010000… |
… | …010110010110001001 |
3 | 11211111012100012101111 |
4 | 233011100112112021 |
5 | 1312013313201031 |
6 | 35120232250321 |
7 | 3436530141562 |
oct | 570520262611 |
9 | 154435305344 |
10 | 50554037641 |
11 | 1a4924887a8 |
12 | 996a5409a1 |
13 | 49c8794c53 |
14 | 2638151169 |
15 | 14ad3341b1 |
hex | bc5416589 |
50554037641 has 4 divisors (see below), whose sum is σ = 50558081284. Its totient is φ = 50549994000.
The previous prime is 50554037609. The next prime is 50554037693. The reversal of 50554037641 is 14673045505.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14673045505 = 5 ⋅2934609101.
It can be written as a sum of positive squares in 2 ways, for example, as 46097807616 + 4456230025 = 214704^2 + 66755^2 .
It is a cyclic number.
It is not a de Polignac number, because 50554037641 - 25 = 50554037609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50554037594 and 50554037603.
It is not an unprimeable number, because it can be changed into a prime (50554037041) 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, 2003010 + ... + 2028091.
It is an arithmetic number, because the mean of its divisors is an integer number (12639520321).
Almost surely, 250554037641 is an apocalyptic number.
It is an amenable number.
50554037641 is a deficient number, since it is larger than the sum of its proper divisors (4043643).
50554037641 is a wasteful number, since it uses less digits than its factorization.
50554037641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4043642.
The product of its (nonzero) digits is 252000, while the sum is 40.
The spelling of 50554037641 in words is "fifty billion, five hundred fifty-four million, thirty-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •