Base | Representation |
---|---|
bin | 101110100110001001… |
… | …110011010111000101 |
3 | 11210010211110111211101 |
4 | 232212021303113011 |
5 | 1304431222242111 |
6 | 34552352140101 |
7 | 3420562630204 |
oct | 564611632705 |
9 | 153124414741 |
10 | 50032227781 |
11 | 1a244985288 |
12 | 9843837631 |
13 | 4944644a13 |
14 | 25c8b1d23b |
15 | 147c60dbc1 |
hex | ba62735c5 |
50032227781 has 8 divisors (see below), whose sum is σ = 50671617920. Its totient is φ = 49392989568.
The previous prime is 50032227779. The next prime is 50032227809. The reversal of 50032227781 is 18772223005.
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 50032227781 - 21 = 50032227779 is a prime.
It is a super-2 number, since 2×500322277812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50032227781.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50032227731) 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, 721045 + ... + 787381.
It is an arithmetic number, because the mean of its divisors is an integer number (6333952240).
Almost surely, 250032227781 is an apocalyptic number.
It is an amenable number.
50032227781 is a deficient number, since it is larger than the sum of its proper divisors (639390139).
50032227781 is an equidigital number, since it uses as much as digits as its factorization.
50032227781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75963.
The product of its (nonzero) digits is 47040, while the sum is 37.
The spelling of 50032227781 in words is "fifty billion, thirty-two million, two hundred twenty-seven thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •