Base | Representation |
---|---|
bin | 10110111110101010110001… |
… | …01010010001010101100001 |
3 | 20121220210100110202002020102 |
4 | 23133111120222101111201 |
5 | 23110403040043313010 |
6 | 255245551143152145 |
7 | 13433541362412524 |
oct | 1337253052212541 |
9 | 217823313662212 |
10 | 50531777713505 |
11 | 15112452182030 |
12 | 5801492145655 |
13 | 2227184321b0a |
14 | c69a72dcabbb |
15 | 5c96aa4c1ba5 |
hex | 2df558a91561 |
50531777713505 has 32 divisors (see below), whose sum is σ = 67140483949440. Its totient is φ = 36200539077120.
The previous prime is 50531777713499. The next prime is 50531777713517.
50531777713505 is nontrivially palindromic in base 10.
50531777713505 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 50531777713505 - 216 = 50531777647969 is a prime.
It is a Curzon number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 106026581 + ... + 106502109.
It is an arithmetic number, because the mean of its divisors is an integer number (2098140123420).
Almost surely, 250531777713505 is an apocalyptic number.
50531777713505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50531777713505 is a deficient number, since it is larger than the sum of its proper divisors (16608706235935).
50531777713505 is a wasteful number, since it uses less digits than its factorization.
50531777713505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504449.
The product of its (nonzero) digits is 13505625, while the sum is 56.
The spelling of 50531777713505 in words is "fifty trillion, five hundred thirty-one billion, seven hundred seventy-seven million, seven hundred thirteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •