Base | Representation |
---|---|
bin | 10111001000111001000001… |
… | …11000110011000111110101 |
3 | 20200011100222210121021120111 |
4 | 23210130200320303013311 |
5 | 23132131421001103320 |
6 | 300115201352103021 |
7 | 13501114620650101 |
oct | 1344344070630765 |
9 | 220140883537514 |
10 | 50883029316085 |
11 | 1523840a59297a |
12 | 585957b694a71 |
13 | 22513312b1585 |
14 | c7ca74b82901 |
15 | 5d38b7355a5a |
hex | 2e4720e331f5 |
50883029316085 has 8 divisors (see below), whose sum is σ = 61302900659616. Its totient is φ = 40544246466000.
The previous prime is 50883029316073. The next prime is 50883029316101. The reversal of 50883029316085 is 58061392038805.
50883029316085 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50883029316085 - 231 = 50880881832437 is a prime.
It is a Duffinian number.
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 7 ways as a sum of consecutive naturals, for example, 20272121979 + ... + 20272124488.
It is an arithmetic number, because the mean of its divisors is an integer number (7662862582452).
Almost surely, 250883029316085 is an apocalyptic number.
It is an amenable number.
50883029316085 is a deficient number, since it is larger than the sum of its proper divisors (10419871343531).
50883029316085 is a wasteful number, since it uses less digits than its factorization.
50883029316085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40544246723.
The product of its (nonzero) digits is 12441600, while the sum is 58.
The spelling of 50883029316085 in words is "fifty trillion, eight hundred eighty-three billion, twenty-nine million, three hundred sixteen thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •