Base | Representation |
---|---|
bin | 1100000000011… |
… | …1010001010111 |
3 | 10111202121220012 |
4 | 3000013101113 |
5 | 100343031211 |
6 | 4555230435 |
7 | 1151031221 |
oct | 300072127 |
9 | 114677805 |
10 | 50361431 |
11 | 2647831a |
12 | 14a4841b |
13 | a583a83 |
14 | 698d411 |
15 | 464bd8b |
hex | 3007457 |
50361431 has 4 divisors (see below), whose sum is σ = 50376600. Its totient is φ = 50346264.
The previous prime is 50361427. The next prime is 50361433. The reversal of 50361431 is 13416305.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50361431 - 22 = 50361427 is a prime.
It is a super-2 number, since 2×503614312 = 5072547464735522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50361397 and 50361406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50361433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221 + ... + 10038.
It is an arithmetic number, because the mean of its divisors is an integer number (12594150).
Almost surely, 250361431 is an apocalyptic number.
50361431 is a deficient number, since it is larger than the sum of its proper divisors (15169).
50361431 is a wasteful number, since it uses less digits than its factorization.
50361431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15168.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 50361431 is about 7096.5788236304. The cubic root of 50361431 is about 369.2887016326.
Adding to 50361431 its reverse (13416305), we get a palindrome (63777736).
The spelling of 50361431 in words is "fifty million, three hundred sixty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •