Base | Representation |
---|---|
bin | 1100000101010… |
… | …0001001101011 |
3 | 10112100121212011 |
4 | 3001110021223 |
5 | 100433120311 |
6 | 5010100351 |
7 | 1153512256 |
oct | 301241153 |
9 | 115317764 |
10 | 50676331 |
11 | 26672972 |
12 | 14b7a6b7 |
13 | a6641c4 |
14 | 6a3209d |
15 | 46b0321 |
hex | 305426b |
50676331 has 4 divisors (see below), whose sum is σ = 50743000. Its totient is φ = 50609664.
The previous prime is 50676323. The next prime is 50676341. The reversal of 50676331 is 13367605.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13367605 = 5 ⋅2673521.
It is a cyclic number.
It is not a de Polignac number, because 50676331 - 23 = 50676323 is a prime.
It is a super-2 number, since 2×506763312 = 5136181047243122, 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 = 50676293 and 50676302.
It is not an unprimeable number, because it can be changed into a prime (50676341) 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, 32181 + ... + 33718.
It is an arithmetic number, because the mean of its divisors is an integer number (12685750).
Almost surely, 250676331 is an apocalyptic number.
50676331 is a deficient number, since it is larger than the sum of its proper divisors (66669).
50676331 is an equidigital number, since it uses as much as digits as its factorization.
50676331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66668.
The product of its (nonzero) digits is 11340, while the sum is 31.
The square root of 50676331 is about 7118.7309964628. The cubic root of 50676331 is about 370.0567991692.
The spelling of 50676331 in words is "fifty million, six hundred seventy-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •