Base | Representation |
---|---|
bin | 10110111110001000101111… |
… | …10110000001100111010101 |
3 | 20121212001012101120202002111 |
4 | 23133010113312001213111 |
5 | 23110103132131002423 |
6 | 255233330351311021 |
7 | 13432323610024162 |
oct | 1337042766014725 |
9 | 217761171522074 |
10 | 50513510406613 |
11 | 15105728815a91 |
12 | 57b9a3451b471 |
13 | 22255328cc497 |
14 | c68c1cc9b069 |
15 | 5c8e8b91660d |
hex | 2df117d819d5 |
50513510406613 has 8 divisors (see below), whose sum is σ = 51296427456768. Its totient is φ = 49733051495904.
The previous prime is 50513510406607. The next prime is 50513510406637. The reversal of 50513510406613 is 31660401531505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50513510406613 is a prime.
It is a super-2 number, since 2×505135104066132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50513510406643) 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, 614493445 + ... + 614575642.
It is an arithmetic number, because the mean of its divisors is an integer number (6412053432096).
Almost surely, 250513510406613 is an apocalyptic number.
It is an amenable number.
50513510406613 is a deficient number, since it is larger than the sum of its proper divisors (782917050155).
50513510406613 is a wasteful number, since it uses less digits than its factorization.
50513510406613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1229069723.
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 50513510406613 in words is "fifty trillion, five hundred thirteen billion, five hundred ten million, four hundred six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •