Base | Representation |
---|---|
bin | 10110110000111101000010… |
… | …10101001001010111100011 |
3 | 20120020202000211121212201020 |
4 | 23120132201111021113203 |
5 | 23030143001412310201 |
6 | 254245255512540523 |
7 | 13354520052313314 |
oct | 1330364125112743 |
9 | 216222024555636 |
10 | 50060550510051 |
11 | 14a50618761534 |
12 | 57460a10b1743 |
13 | 21c18c723b853 |
14 | c50d2d24060b |
15 | 5bc2ca8a6a36 |
hex | 2d87a15495e3 |
50060550510051 has 16 divisors (see below), whose sum is σ = 69230111076768. Its totient is φ = 32150206368000.
The previous prime is 50060550510037. The next prime is 50060550510127. The reversal of 50060550510051 is 15001505506005.
50060550510051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50060550510051 - 210 = 50060550509027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50060550509994 and 50060550510021.
It is not an unprimeable number, because it can be changed into a prime (50060550511051) 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 15 ways as a sum of consecutive naturals, for example, 2232642010 + ... + 2232664431.
It is an arithmetic number, because the mean of its divisors is an integer number (4326881942298).
Almost surely, 250060550510051 is an apocalyptic number.
50060550510051 is a deficient number, since it is larger than the sum of its proper divisors (19169560566717).
50060550510051 is a wasteful number, since it uses less digits than its factorization.
50060550510051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4465306582.
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 50060550510051 in words is "fifty trillion, sixty billion, five hundred fifty million, five hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •