Base | Representation |
---|---|
bin | 101111000010110011… |
… | …110111001011010011 |
3 | 11211101100011001121012 |
4 | 233002303313023103 |
5 | 1311422312444012 |
6 | 35112205121135 |
7 | 3435521355533 |
oct | 570263671323 |
9 | 154340131535 |
10 | 50513015507 |
11 | 1a47130a209 |
12 | 99588591ab |
13 | 49c01310b6 |
14 | 26329134c3 |
15 | 14a992e622 |
hex | bc2cf72d3 |
50513015507 has 2 divisors, whose sum is σ = 50513015508. Its totient is φ = 50513015506.
The previous prime is 50513015479. The next prime is 50513015521. The reversal of 50513015507 is 70551031505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50513015507 - 224 = 50496238291 is a prime.
It is a super-2 number, since 2×505130155072 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50513015557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25256507753 + 25256507754.
It is an arithmetic number, because the mean of its divisors is an integer number (25256507754).
Almost surely, 250513015507 is an apocalyptic number.
50513015507 is a deficient number, since it is larger than the sum of its proper divisors (1).
50513015507 is an equidigital number, since it uses as much as digits as its factorization.
50513015507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13125, while the sum is 32.
The spelling of 50513015507 in words is "fifty billion, five hundred thirteen million, fifteen thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •