Base | Representation |
---|---|
bin | 101110111111101011… |
… | …100111001100011001 |
3 | 11211020200101002000010 |
4 | 232333223213030121 |
5 | 1311320343134431 |
6 | 35103052032133 |
7 | 3434313232164 |
oct | 567753471431 |
9 | 154220332003 |
10 | 50460521241 |
11 | 1a444715519 |
12 | 9943162649 |
13 | 49b22b15c0 |
14 | 262996aadb |
15 | 14a5010846 |
hex | bbfae7319 |
50460521241 has 32 divisors (see below), whose sum is σ = 73609242112. Its totient is φ = 30560302080.
The previous prime is 50460521239. The next prime is 50460521263. The reversal of 50460521241 is 14212506405.
It is not a de Polignac number, because 50460521241 - 21 = 50460521239 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50460521199 and 50460521208.
It is not an unprimeable number, because it can be changed into a prime (50460521141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1299021 + ... + 1337301.
It is an arithmetic number, because the mean of its divisors is an integer number (2300288816).
Almost surely, 250460521241 is an apocalyptic number.
It is an amenable number.
50460521241 is a deficient number, since it is larger than the sum of its proper divisors (23148720871).
50460521241 is a wasteful number, since it uses less digits than its factorization.
50460521241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38833.
The product of its (nonzero) digits is 9600, while the sum is 30.
The spelling of 50460521241 in words is "fifty billion, four hundred sixty million, five hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •