Base | Representation |
---|---|
bin | 1100001000100… |
… | …0101010100111 |
3 | 10112202112220211 |
4 | 3002020222213 |
5 | 101012011211 |
6 | 5014440251 |
7 | 1155366343 |
oct | 302105247 |
9 | 115675824 |
10 | 50891431 |
11 | 267aa538 |
12 | 15063087 |
13 | a70b096 |
14 | 6a8a623 |
15 | 4703e21 |
hex | 3088aa7 |
50891431 has 4 divisors (see below), whose sum is σ = 50905792. Its totient is φ = 50877072.
The previous prime is 50891411. The next prime is 50891437. The reversal of 50891431 is 13419805.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 50891431 - 219 = 50367143 is a prime.
It is a super-2 number, since 2×508914312 = 5179875498455522, 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 = 50891393 and 50891402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50891437) 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, 2371 + ... + 10363.
It is an arithmetic number, because the mean of its divisors is an integer number (12726448).
Almost surely, 250891431 is an apocalyptic number.
50891431 is a deficient number, since it is larger than the sum of its proper divisors (14361).
50891431 is an equidigital number, since it uses as much as digits as its factorization.
50891431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14360.
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 50891431 is about 7133.8230283628. The cubic root of 50891431 is about 370.5796393122.
The spelling of 50891431 in words is "fifty million, eight hundred ninety-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •