Base | Representation |
---|---|
bin | 10111000100011100001001… |
… | …10000000010100000101101 |
3 | 20122121202012220121200122101 |
4 | 23202032010300002200231 |
5 | 23122130203443400030 |
6 | 255521025120215101 |
7 | 13454061551350411 |
oct | 1342160460024055 |
9 | 218552186550571 |
10 | 50730085918765 |
11 | 15189565a74860 |
12 | 58339b716a491 |
13 | 223ca98ca83c6 |
14 | c754c6520d41 |
15 | 5ce9151637ca |
hex | 2e2384c0282d |
50730085918765 has 32 divisors (see below), whose sum is σ = 66440601464832. Its totient is φ = 36877774824000.
The previous prime is 50730085918693. The next prime is 50730085918777. The reversal of 50730085918765 is 56781958003705.
It is a de Polignac number, because none of the positive numbers 2k-50730085918765 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50730085918697 and 50730085918706.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1172359080 + ... + 1172402350.
It is an arithmetic number, because the mean of its divisors is an integer number (2076268795776).
Almost surely, 250730085918765 is an apocalyptic number.
50730085918765 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50730085918765 is a deficient number, since it is larger than the sum of its proper divisors (15710515546067).
50730085918765 is a wasteful number, since it uses less digits than its factorization.
50730085918765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52521.
The product of its (nonzero) digits is 63504000, while the sum is 64.
The spelling of 50730085918765 in words is "fifty trillion, seven hundred thirty billion, eighty-five million, nine hundred eighteen thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •