Base | Representation |
---|---|
bin | 101111000101010000… |
… | …011110000111011101 |
3 | 11211111012101211001022 |
4 | 233011100132013131 |
5 | 1312013320210334 |
6 | 35120233053525 |
7 | 3436530333431 |
oct | 570520360735 |
9 | 154435354038 |
10 | 50554069469 |
11 | 1a4924aa702 |
12 | 996a5572a5 |
13 | 49c87a6597 |
14 | 263815c9c1 |
15 | 14ad33d82e |
hex | bc541e1dd |
50554069469 has 2 divisors, whose sum is σ = 50554069470. Its totient is φ = 50554069468.
The previous prime is 50554069463. The next prime is 50554069571. The reversal of 50554069469 is 96496045505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45364740100 + 5189329369 = 212990^2 + 72037^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50554069469 is a prime.
It is a super-2 number, since 2×505540694692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50554069469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50554069463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25277034734 + 25277034735.
It is an arithmetic number, because the mean of its divisors is an integer number (25277034735).
Almost surely, 250554069469 is an apocalyptic number.
It is an amenable number.
50554069469 is a deficient number, since it is larger than the sum of its proper divisors (1).
50554069469 is an equidigital number, since it uses as much as digits as its factorization.
50554069469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832000, while the sum is 53.
The spelling of 50554069469 in words is "fifty billion, five hundred fifty-four million, sixty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •