Base | Representation |
---|---|
bin | 10111000010100100001000… |
… | …11000011011101101001111 |
3 | 20122101120220121220010021120 |
4 | 23201102010120123231033 |
5 | 23120101230214033241 |
6 | 255431251454532023 |
7 | 13446321111431622 |
oct | 1341220430335517 |
9 | 218346817803246 |
10 | 50665655221071 |
11 | 15164202580a70 |
12 | 5823415507013 |
13 | 223699b62a807 |
14 | c72333441db9 |
15 | 5ccde3961666 |
hex | 2e148461bb4f |
50665655221071 has 32 divisors (see below), whose sum is σ = 78051400416000. Its totient is φ = 28892464903680.
The previous prime is 50665655221057. The next prime is 50665655221073. The reversal of 50665655221071 is 17012255656605.
It is not a de Polignac number, because 50665655221071 - 239 = 50115899407183 is a prime.
It is a super-3 number, since 3×506656552210713 (a number of 42 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50665655221073) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9979596 + ... + 14174753.
It is an arithmetic number, because the mean of its divisors is an integer number (2439106263000).
Almost surely, 250665655221071 is an apocalyptic number.
50665655221071 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
50665655221071 is a deficient number, since it is larger than the sum of its proper divisors (27385745194929).
50665655221071 is a wasteful number, since it uses less digits than its factorization.
50665655221071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24158119.
The product of its (nonzero) digits is 3780000, while the sum is 51.
The spelling of 50665655221071 in words is "fifty trillion, six hundred sixty-five billion, six hundred fifty-five million, two hundred twenty-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •