Base | Representation |
---|---|
bin | 101110100110101100… |
… | …000010011011110101 |
3 | 11210011110100110201110 |
4 | 232212230002123311 |
5 | 1304441021434141 |
6 | 34553312345233 |
7 | 3421032126300 |
oct | 564654023365 |
9 | 153143313643 |
10 | 50041202421 |
11 | 1a249a55041 |
12 | 9846845219 |
13 | 4946467962 |
14 | 25c9db7b37 |
15 | 147d2d2e16 |
hex | ba6b026f5 |
50041202421 has 12 divisors (see below), whose sum is σ = 77614926432. Its totient is φ = 28594972728.
The previous prime is 50041202417. The next prime is 50041202459. The reversal of 50041202421 is 12420214005.
It is not a de Polignac number, because 50041202421 - 22 = 50041202417 is a prime.
It is a super-2 number, since 2×500412024212 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50041202401) 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 11 ways as a sum of consecutive naturals, for example, 170208025 + ... + 170208318.
It is an arithmetic number, because the mean of its divisors is an integer number (6467910536).
Almost surely, 250041202421 is an apocalyptic number.
It is an amenable number.
50041202421 is a deficient number, since it is larger than the sum of its proper divisors (27573724011).
50041202421 is a wasteful number, since it uses less digits than its factorization.
50041202421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340416360 (or 340416353 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 21.
Adding to 50041202421 its reverse (12420214005), we get a palindrome (62461416426).
The spelling of 50041202421 in words is "fifty billion, forty-one million, two hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •