Base | Representation |
---|---|
bin | 1011111100101… |
… | …0001000011001 |
3 | 10111021220101000 |
4 | 2333022020121 |
5 | 100312023001 |
6 | 4550015213 |
7 | 1145636133 |
oct | 277121031 |
9 | 114256330 |
10 | 50111001 |
11 | 26317156 |
12 | 14947509 |
13 | a4c6aa5 |
14 | 6926053 |
15 | 45eca86 |
hex | 2fca219 |
50111001 has 32 divisors (see below), whose sum is σ = 76608000. Its totient is φ = 32359824.
The previous prime is 50110981. The next prime is 50111003. The reversal of 50111001 is 10011105.
50111001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50111001 - 210 = 50109977 is a prime.
It is a super-2 number, since 2×501110012 = 5022224842444002, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (50111003) 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 31 ways as a sum of consecutive naturals, for example, 132030 + ... + 132408.
It is an arithmetic number, because the mean of its divisors is an integer number (2394000).
Almost surely, 250111001 is an apocalyptic number.
It is an amenable number.
50111001 is a deficient number, since it is larger than the sum of its proper divisors (26496999).
50111001 is a wasteful number, since it uses less digits than its factorization.
50111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530 (or 524 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
The square root of 50111001 is about 7078.9124164662. The cubic root of 50111001 is about 368.6755691582.
Adding to 50111001 its reverse (10011105), we get a palindrome (60122106).
The spelling of 50111001 in words is "fifty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •