Base | Representation |
---|---|
bin | 101111000010110001… |
… | …100000111010011111 |
3 | 11211101021222210022210 |
4 | 233002301200322133 |
5 | 1311422133300111 |
6 | 35112144011503 |
7 | 3435513213252 |
oct | 570261407237 |
9 | 154337883283 |
10 | 50512400031 |
11 | 1a470a29855 |
12 | 9958600b93 |
13 | 49bcc76c02 |
14 | 26327d3099 |
15 | 14a985c0a6 |
hex | bc2c60e9f |
50512400031 has 4 divisors (see below), whose sum is σ = 67349866712. Its totient is φ = 33674933352.
The previous prime is 50512400027. The next prime is 50512400077. The reversal of 50512400031 is 13000421505.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 50512400031 - 22 = 50512400027 is a prime.
It is a super-2 number, since 2×505124000312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50512399980 and 50512400007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50512400021) 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 in 3 ways as a sum of consecutive naturals, for example, 8418733336 + ... + 8418733341.
It is an arithmetic number, because the mean of its divisors is an integer number (16837466678).
Almost surely, 250512400031 is an apocalyptic number.
50512400031 is a deficient number, since it is larger than the sum of its proper divisors (16837466681).
50512400031 is a wasteful number, since it uses less digits than its factorization.
50512400031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16837466680.
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 50512400031 its reverse (13000421505), we get a palindrome (63512821536).
The spelling of 50512400031 in words is "fifty billion, five hundred twelve million, four hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •