Base | Representation |
---|---|
bin | 10111000010100100001000… |
… | …11000011011101101110001 |
3 | 20122101120220121220010022211 |
4 | 23201102010120123231301 |
5 | 23120101230214033410 |
6 | 255431251454532121 |
7 | 13446321111432001 |
oct | 1341220430335561 |
9 | 218346817803284 |
10 | 50665655221105 |
11 | 15164202580aa1 |
12 | 5823415507041 |
13 | 223699b62a832 |
14 | c72333442001 |
15 | 5ccde396168a |
hex | 2e148461bb71 |
50665655221105 has 8 divisors (see below), whose sum is σ = 64375185457512. Its totient is φ = 38148258048768.
The previous prime is 50665655221073. The next prime is 50665655221109. The reversal of 50665655221105 is 50112255656605.
It can be written as a sum of positive squares in 4 ways, for example, as 27816805898896 + 22848849322209 = 5274164^2 + 4780047^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50665655221105 - 25 = 50665655221073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50665655221109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 298033265922 + ... + 298033266091.
It is an arithmetic number, because the mean of its divisors is an integer number (8046898182189).
Almost surely, 250665655221105 is an apocalyptic number.
It is an amenable number.
50665655221105 is a deficient number, since it is larger than the sum of its proper divisors (13709530236407).
50665655221105 is a wasteful number, since it uses less digits than its factorization.
50665655221105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596066532035.
The product of its (nonzero) digits is 2700000, while the sum is 49.
The spelling of 50665655221105 in words is "fifty trillion, six hundred sixty-five billion, six hundred fifty-five million, two hundred twenty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •