Base | Representation |
---|---|
bin | 10110111011100010100111… |
… | …10111100010000001100011 |
3 | 20121112111222202222012212022 |
4 | 23131301103313202001203 |
5 | 23102123003204340001 |
6 | 255124340402252055 |
7 | 13423015506431102 |
oct | 1335612367420143 |
9 | 217474882865768 |
10 | 50424323121251 |
11 | 1508092092a492 |
12 | 57a46a395702b |
13 | 2219cbb292451 |
14 | c6479bcb8039 |
15 | 5c69bbac411b |
hex | 2ddc53de2063 |
50424323121251 has 8 divisors (see below), whose sum is σ = 52910632961280. Its totient is φ = 47962508945032.
The previous prime is 50424323121233. The next prime is 50424323121253. The reversal of 50424323121251 is 15212132342405.
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 50424323121251 - 230 = 50423249379427 is a prime.
It is a super-2 number, since 2×504243231212512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50424323121253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6123911735 + ... + 6123919968.
It is an arithmetic number, because the mean of its divisors is an integer number (6613829120160).
Almost surely, 250424323121251 is an apocalyptic number.
50424323121251 is a deficient number, since it is larger than the sum of its proper divisors (2486309840029).
50424323121251 is a wasteful number, since it uses less digits than its factorization.
50424323121251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12247831905.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 50424323121251 its reverse (15212132342405), we get a palindrome (65636455463656).
The spelling of 50424323121251 in words is "fifty trillion, four hundred twenty-four billion, three hundred twenty-three million, one hundred twenty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •