Base | Representation |
---|---|
bin | 10110111001100000010001… |
… | …01000000111011100111010 |
3 | 20121021211100121211222102210 |
4 | 23130300020220013130322 |
5 | 23100001142333443224 |
6 | 255032244241235550 |
7 | 13414660343034444 |
oct | 1334601050073472 |
9 | 217254317758383 |
10 | 50354341312314 |
11 | 15054179a32656 |
12 | 5793013032bb6 |
13 | 2213517846a50 |
14 | c6123d879494 |
15 | 5c4c72da8429 |
hex | 2dcc08a0773a |
50354341312314 has 64 divisors (see below), whose sum is σ = 111119986510848. Its totient is φ = 15113133964800.
The previous prime is 50354341312283. The next prime is 50354341312357. The reversal of 50354341312314 is 41321314345305.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17160132 + ... + 19879104.
It is an arithmetic number, because the mean of its divisors is an integer number (1736249789232).
Almost surely, 250354341312314 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50354341312314, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55559993255424).
50354341312314 is an abundant number, since it is smaller than the sum of its proper divisors (60765645198534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50354341312314 is a wasteful number, since it uses less digits than its factorization.
50354341312314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2724823.
The product of its (nonzero) digits is 259200, while the sum is 39.
Adding to 50354341312314 its reverse (41321314345305), we get a palindrome (91675655657619).
The spelling of 50354341312314 in words is "fifty trillion, three hundred fifty-four billion, three hundred forty-one million, three hundred twelve thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •