Base | Representation |
---|---|
bin | 10110110000011010111011… |
… | …00101011000001111100101 |
3 | 20120011222202022222001211001 |
4 | 23120031131211120033211 |
5 | 23024342443403423123 |
6 | 254233030203313301 |
7 | 13353301132035631 |
oct | 1330153545301745 |
9 | 216158668861731 |
10 | 50042234045413 |
11 | 14a4387957a555 |
12 | 574262ab1b831 |
13 | 21bcc685972ac |
14 | c500b2795dc1 |
15 | 5bbaa783b0ad |
hex | 2d835d9583e5 |
50042234045413 has 4 divisors (see below), whose sum is σ = 50102744607360. Its totient is φ = 49981723483468.
The previous prime is 50042234045399. The next prime is 50042234045471. The reversal of 50042234045413 is 31454043224005.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50042234045413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50042234040413) 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, 30255279733 + ... + 30255281386.
It is an arithmetic number, because the mean of its divisors is an integer number (12525686151840).
Almost surely, 250042234045413 is an apocalyptic number.
It is an amenable number.
50042234045413 is a deficient number, since it is larger than the sum of its proper divisors (60510561947).
50042234045413 is an equidigital number, since it uses as much as digits as its factorization.
50042234045413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60510561946.
The product of its (nonzero) digits is 230400, while the sum is 37.
Adding to 50042234045413 its reverse (31454043224005), we get a palindrome (81496277269418).
The spelling of 50042234045413 in words is "fifty trillion, forty-two billion, two hundred thirty-four million, forty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •