Base | Representation |
---|---|
bin | 10110110000011110010010… |
… | …10111010100111100011101 |
3 | 20120012011102100111222110002 |
4 | 23120033021113110330131 |
5 | 23024410144312114323 |
6 | 254233525440424045 |
7 | 13353364006666502 |
oct | 1330171127247435 |
9 | 216164370458402 |
10 | 50044042301213 |
11 | 14a44617262934 |
12 | 5742a54618025 |
13 | 21c01960b803c |
14 | c502049bb4a9 |
15 | 5bbb61475828 |
hex | 2d83c95d4f1d |
50044042301213 has 8 divisors (see below), whose sum is σ = 53008979260608. Its totient is φ = 47081457537984.
The previous prime is 50044042301189. The next prime is 50044042301311. The reversal of 50044042301213 is 31210324044005.
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 50044042301213 - 244 = 32451856256797 is a prime.
It is a super-2 number, since 2×500440423012132 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50044042201213) 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, 588005231 + ... + 588090332.
It is an arithmetic number, because the mean of its divisors is an integer number (6626122407576).
Almost surely, 250044042301213 is an apocalyptic number.
It is an amenable number.
50044042301213 is a deficient number, since it is larger than the sum of its proper divisors (2964936959395).
50044042301213 is a wasteful number, since it uses less digits than its factorization.
50044042301213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1176098083.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 50044042301213 its reverse (31210324044005), we get a palindrome (81254366345218).
The spelling of 50044042301213 in words is "fifty trillion, forty-four billion, forty-two million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •