Base | Representation |
---|---|
bin | 101111001010011010… |
… | …000001110111001101 |
3 | 11211201012221222022022 |
4 | 233022122001313031 |
5 | 1312202424230021 |
6 | 35133000455525 |
7 | 3441626550515 |
oct | 571232016715 |
9 | 154635858268 |
10 | 50640461261 |
11 | 1a527247085 |
12 | 999347a5a5 |
13 | 4a106640a0 |
14 | 264580a845 |
15 | 14b5c061ab |
hex | bca681dcd |
50640461261 has 8 divisors (see below), whose sum is σ = 54538572984. Its totient is φ = 46742734080.
The previous prime is 50640461257. The next prime is 50640461299. The reversal of 50640461261 is 16216404605.
It can be written as a sum of positive squares in 4 ways, for example, as 2103965161 + 48536496100 = 45869^2 + 220310^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 50640461261 - 22 = 50640461257 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 (50640461251) 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 in 7 ways as a sum of consecutive naturals, for example, 214601 + ... + 383841.
It is an arithmetic number, because the mean of its divisors is an integer number (6817321623).
Almost surely, 250640461261 is an apocalyptic number.
It is an amenable number.
50640461261 is a deficient number, since it is larger than the sum of its proper divisors (3898111723).
50640461261 is a wasteful number, since it uses less digits than its factorization.
50640461261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192271.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 50640461261 its reverse (16216404605), we get a palindrome (66856865866).
The spelling of 50640461261 in words is "fifty billion, six hundred forty million, four hundred sixty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •