Base | Representation |
---|---|
bin | 1100000101100… |
… | …0100001010111 |
3 | 10112101112102010 |
4 | 3001120201113 |
5 | 100434203411 |
6 | 5010315303 |
7 | 1153615410 |
oct | 301304127 |
9 | 115345363 |
10 | 50694231 |
11 | 26685365 |
12 | 14b88b33 |
13 | a66c3b3 |
14 | 6a38807 |
15 | 46b57a6 |
hex | 3058857 |
50694231 has 32 divisors (see below), whose sum is σ = 81469440. Its totient is φ = 27412704.
The previous prime is 50694229. The next prime is 50694239. The reversal of 50694231 is 13249605.
It is not a de Polignac number, because 50694231 - 21 = 50694229 is a prime.
It is a super-2 number, since 2×506942312 = 5139810113362722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50694239) 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 31 ways as a sum of consecutive naturals, for example, 49240 + ... + 50258.
It is an arithmetic number, because the mean of its divisors is an integer number (2545920).
Almost surely, 250694231 is an apocalyptic number.
50694231 is a deficient number, since it is larger than the sum of its proper divisors (30775209).
50694231 is a wasteful number, since it uses less digits than its factorization.
50694231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1155.
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 50694231 is about 7119.9881320126. The cubic root of 50694231 is about 370.1003647866.
The spelling of 50694231 in words is "fifty million, six hundred ninety-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •