Base | Representation |
---|---|
bin | 1011111011010… |
… | …0110111111011 |
3 | 10111010110221012 |
4 | 2332310313323 |
5 | 100301231211 |
6 | 4544104135 |
7 | 1145124236 |
oct | 276646773 |
9 | 114113835 |
10 | 50023931 |
11 | 262677a1 |
12 | 1490504b |
13 | a496279 |
14 | 690241d |
15 | 45d1d8b |
hex | 2fb4dfb |
50023931 has 2 divisors, whose sum is σ = 50023932. Its totient is φ = 50023930.
The previous prime is 50023913. The next prime is 50023937. The reversal of 50023931 is 13932005.
It is a happy number.
Together with previous prime (50023913) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50023931 is a prime.
It is a super-2 number, since 2×500239312 = 5004787345385522, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 50023897 and 50023906.
It is not a weakly prime, because it can be changed into another prime (50023937) 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, 25011965 + 25011966.
It is an arithmetic number, because the mean of its divisors is an integer number (25011966).
Almost surely, 250023931 is an apocalyptic number.
50023931 is a deficient number, since it is larger than the sum of its proper divisors (1).
50023931 is an equidigital number, since it uses as much as digits as its factorization.
50023931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 23.
The square root of 50023931 is about 7072.7597866745. The cubic root of 50023931 is about 368.4619155281.
Adding to 50023931 its reverse (13932005), we get a palindrome (63955936).
The spelling of 50023931 in words is "fifty million, twenty-three thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •