Base | Representation |
---|---|
bin | 10111000000110100001011… |
… | …10111010101001110010011 |
3 | 20122011211202211100210010010 |
4 | 23200122011313111032103 |
5 | 23113110131420243201 |
6 | 255343511411210003 |
7 | 13442062501262241 |
oct | 1340320567251623 |
9 | 218154684323103 |
10 | 50605550556051 |
11 | 1514076a006597 |
12 | 58138405a6903 |
13 | 22311102b567a |
14 | c6d470b05791 |
15 | 5cb576e36bd6 |
hex | 2e0685dd5393 |
50605550556051 has 8 divisors (see below), whose sum is σ = 67474238136784. Its totient is φ = 33736948339680.
The previous prime is 50605550555897. The next prime is 50605550556091. The reversal of 50605550556051 is 15065505550605.
50605550556051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50605550556051 - 243 = 41809457533843 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50605550556091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19944796 + ... + 22338441.
It is an arithmetic number, because the mean of its divisors is an integer number (8434279767098).
Almost surely, 250605550556051 is an apocalyptic number.
50605550556051 is a deficient number, since it is larger than the sum of its proper divisors (16868687580733).
50605550556051 is a wasteful number, since it uses less digits than its factorization.
50605550556051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42682181.
The product of its (nonzero) digits is 2812500, while the sum is 48.
The spelling of 50605550556051 in words is "fifty trillion, six hundred five billion, five hundred fifty million, five hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •