Base | Representation |
---|---|
bin | 10110111110011100101111… |
… | …01000100111100110100010 |
3 | 20121220001220110022112222212 |
4 | 23133032113220213212202 |
5 | 23110242123020413214 |
6 | 255242303432202122 |
7 | 13433153605505336 |
oct | 1337162750474642 |
9 | 217801813275885 |
10 | 50524244310434 |
11 | 1510a236826884 |
12 | 57bbb2b239342 |
13 | 2226553669b6b |
14 | c6955a6a17c6 |
15 | 5c93b8e4253e |
hex | 2df397a279a2 |
50524244310434 has 8 divisors (see below), whose sum is σ = 80244388022508. Its totient is φ = 23776114969600.
The previous prime is 50524244310433. The next prime is 50524244310457. The reversal of 50524244310434 is 43401344242505.
It can be written as a sum of positive squares in 2 ways, for example, as 47412382492225 + 3111861818209 = 6885665^2 + 1764047^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×505242443104342 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50524244310391 and 50524244310400.
It is not an unprimeable number, because it can be changed into a prime (50524244310433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 743003592767 + ... + 743003592834.
Almost surely, 250524244310434 is an apocalyptic number.
50524244310434 is a deficient number, since it is larger than the sum of its proper divisors (29720143712074).
50524244310434 is a wasteful number, since it uses less digits than its factorization.
50524244310434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1486007185620.
The product of its (nonzero) digits is 921600, while the sum is 41.
Adding to 50524244310434 its reverse (43401344242505), we get a palindrome (93925588552939).
The spelling of 50524244310434 in words is "fifty trillion, five hundred twenty-four billion, two hundred forty-four million, three hundred ten thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •