Base | Representation |
---|---|
bin | 10111000011101001110011… |
… | …01001010011000100011101 |
3 | 20122112011110011011102102110 |
4 | 23201310321221103010131 |
5 | 23121204324322302410 |
6 | 255500355024344233 |
7 | 13452113665331511 |
oct | 1341647151230435 |
9 | 218464404142373 |
10 | 50703056056605 |
11 | 151790553552a7 |
12 | 582a712a75079 |
13 | 223a37c070524 |
14 | c74080748141 |
15 | 5cdd82180720 |
hex | 2e1d39a5311d |
50703056056605 has 32 divisors (see below), whose sum is σ = 81234960629760. Its totient is φ = 27004955904000.
The previous prime is 50703056056589. The next prime is 50703056056687. The reversal of 50703056056605 is 50665065030705.
50703056056605 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 50703056056605 - 24 = 50703056056589 is a prime.
It is a super-3 number, since 3×507030560566053 (a number of 42 digits) contains 333 as substring.
It is a congruent 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, 49421355 + ... + 50436855.
It is an arithmetic number, because the mean of its divisors is an integer number (2538592519680).
Almost surely, 250703056056605 is an apocalyptic number.
It is an amenable number.
50703056056605 is a deficient number, since it is larger than the sum of its proper divisors (30531904573155).
50703056056605 is a wasteful number, since it uses less digits than its factorization.
50703056056605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020021.
The product of its (nonzero) digits is 2835000, while the sum is 48.
The spelling of 50703056056605 in words is "fifty trillion, seven hundred three billion, fifty-six million, fifty-six thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •