Base | Representation |
---|---|
bin | 1011111101011… |
… | …1100100001111 |
3 | 10111101200212011 |
4 | 2333113210033 |
5 | 100320303111 |
6 | 4551122051 |
7 | 1146255436 |
oct | 277274417 |
9 | 114350764 |
10 | 50166031 |
11 | 26354533 |
12 | 14973327 |
13 | a515b56 |
14 | 693c11d |
15 | 460e021 |
hex | 2fd790f |
50166031 has 4 divisors (see below), whose sum is σ = 53116992. Its totient is φ = 47215072.
The previous prime is 50165981. The next prime is 50166089. The reversal of 50166031 is 13066105.
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 50166031 - 27 = 50165903 is a prime.
It is a super-2 number, since 2×501660312 = 5033261332585922, 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 = 50165993 and 50166011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50166131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1475455 + ... + 1475488.
It is an arithmetic number, because the mean of its divisors is an integer number (13279248).
Almost surely, 250166031 is an apocalyptic number.
50166031 is a deficient number, since it is larger than the sum of its proper divisors (2950961).
50166031 is a wasteful number, since it uses less digits than its factorization.
50166031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2950960.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 50166031 is about 7082.7982464560. The cubic root of 50166031 is about 368.8104749614.
The spelling of 50166031 in words is "fifty million, one hundred sixty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •