Base | Representation |
---|---|
bin | 10111000011011101010110… |
… | …00000111000000000000001 |
3 | 20122111112012001122110010001 |
4 | 23201232223000320000001 |
5 | 23121102130220044001 |
6 | 255453331235040001 |
7 | 13451456156016421 |
oct | 1341565300700001 |
9 | 218445161573101 |
10 | 50696368128001 |
11 | 1517623317a582 |
12 | 5829367140001 |
13 | 2239854600a1b |
14 | c73a08424481 |
15 | 5cdadee5c001 |
hex | 2e1bab038001 |
50696368128001 has 4 divisors (see below), whose sum is σ = 51775014258432. Its totient is φ = 49617721997572.
The previous prime is 50696368127989. The next prime is 50696368128031. The reversal of 50696368128001 is 10082186369605.
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-50696368128001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50696368128031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 539323065145 + ... + 539323065238.
It is an arithmetic number, because the mean of its divisors is an integer number (12943753564608).
Almost surely, 250696368128001 is an apocalyptic number.
It is an amenable number.
50696368128001 is a deficient number, since it is larger than the sum of its proper divisors (1078646130431).
50696368128001 is a wasteful number, since it uses less digits than its factorization.
50696368128001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1078646130430.
The product of its (nonzero) digits is 3732480, while the sum is 55.
The spelling of 50696368128001 in words is "fifty trillion, six hundred ninety-six billion, three hundred sixty-eight million, one hundred twenty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •