Base | Representation |
---|---|
bin | 101111001001011101… |
… | …100100100001001111 |
3 | 11211200010010202210121 |
4 | 233021131210201033 |
5 | 1312134400044211 |
6 | 35131233045411 |
7 | 3441345051151 |
oct | 571135444117 |
9 | 154603122717 |
10 | 50624612431 |
11 | 1a519301678 |
12 | 998a0b6867 |
13 | 4a0a2a5293 |
14 | 2643682ad1 |
15 | 14b4625271 |
hex | bc976484f |
50624612431 has 2 divisors, whose sum is σ = 50624612432. Its totient is φ = 50624612430.
The previous prime is 50624612399. The next prime is 50624612459. The reversal of 50624612431 is 13421642605.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50624612431 - 25 = 50624612399 is a prime.
It is a super-2 number, since 2×506246124312 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50624610431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25312306215 + 25312306216.
It is an arithmetic number, because the mean of its divisors is an integer number (25312306216).
Almost surely, 250624612431 is an apocalyptic number.
50624612431 is a deficient number, since it is larger than the sum of its proper divisors (1).
50624612431 is an equidigital number, since it uses as much as digits as its factorization.
50624612431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 34.
The spelling of 50624612431 in words is "fifty billion, six hundred twenty-four million, six hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •