Base | Representation |
---|---|
bin | 1011111010111… |
… | …1100000000010 |
3 | 10111002100202001 |
4 | 2332233200002 |
5 | 100300030142 |
6 | 4543414214 |
7 | 1145003125 |
oct | 276574002 |
9 | 114070661 |
10 | 50001922 |
11 | 26252203 |
12 | 148b436a |
13 | a489249 |
14 | 68d83bc |
15 | 45ca5b7 |
hex | 2faf802 |
50001922 has 8 divisors (see below), whose sum is σ = 75051900. Its totient is φ = 24984624.
The previous prime is 50001877. The next prime is 50001923. The reversal of 50001922 is 22910005.
50001922 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 44342281 + 5659641 = 6659^2 + 2379^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 50001922.
It is not an unprimeable number, because it can be changed into a prime (50001923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3897 + ... + 10732.
Almost surely, 250001922 is an apocalyptic number.
50001922 is a deficient number, since it is larger than the sum of its proper divisors (25049978).
50001922 is a wasteful number, since it uses less digits than its factorization.
50001922 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16340.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 50001922 is about 7071.2037164828. The cubic root of 50001922 is about 368.4078702759.
Adding to 50001922 its reverse (22910005), we get a palindrome (72911927).
It can be divided in two parts, 5000 and 1922, that multiplied together give a square (9610000 = 31002).
The spelling of 50001922 in words is "fifty million, one thousand, nine hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •