Base | Representation |
---|---|
bin | 10110111101111100111011… |
… | …11000010010100111100001 |
3 | 20121211102211110111201121222 |
4 | 23132332131320102213201 |
5 | 23110002140304303042 |
6 | 255230401225424425 |
7 | 13432010510540015 |
oct | 1336763570224741 |
9 | 217742743451558 |
10 | 50507169212897 |
11 | 15102a74335321 |
12 | 57b876493b115 |
13 | 2224a61c41957 |
14 | c687baa34545 |
15 | 5c8c19d842d2 |
hex | 2def9de129e1 |
50507169212897 has 4 divisors (see below), whose sum is σ = 51581789834496. Its totient is φ = 49432548591300.
The previous prime is 50507169212881. The next prime is 50507169212921. The reversal of 50507169212897 is 79821296170505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50507169212897 - 24 = 50507169212881 is a prime.
It is a super-2 number, since 2×505071692128972 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50507169212867) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 537310310729 + ... + 537310310822.
It is an arithmetic number, because the mean of its divisors is an integer number (12895447458624).
Almost surely, 250507169212897 is an apocalyptic number.
It is an amenable number.
50507169212897 is a deficient number, since it is larger than the sum of its proper divisors (1074620621599).
50507169212897 is a wasteful number, since it uses less digits than its factorization.
50507169212897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074620621598.
The product of its (nonzero) digits is 19051200, while the sum is 62.
The spelling of 50507169212897 in words is "fifty trillion, five hundred seven billion, one hundred sixty-nine million, two hundred twelve thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •