Base | Representation |
---|---|
bin | 1011111100101… |
… | …1011010001001 |
3 | 10111022011112210 |
4 | 2333023122021 |
5 | 100312204413 |
6 | 4550055333 |
7 | 1145660316 |
oct | 277133211 |
9 | 114264483 |
10 | 50116233 |
11 | 26320082 |
12 | 1494a549 |
13 | a4c929b |
14 | 6927d0d |
15 | 45ee3c3 |
hex | 2fcb689 |
50116233 has 4 divisors (see below), whose sum is σ = 66821648. Its totient is φ = 33410820.
The previous prime is 50116229. The next prime is 50116237. The reversal of 50116233 is 33261105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (50116229) and next prime (50116237).
It is not a de Polignac number, because 50116233 - 22 = 50116229 is a prime.
It is a super-2 number, since 2×501162332 = 5023273620220578, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50116237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8352703 + ... + 8352708.
It is an arithmetic number, because the mean of its divisors is an integer number (16705412).
Almost surely, 250116233 is an apocalyptic number.
It is an amenable number.
50116233 is a deficient number, since it is larger than the sum of its proper divisors (16705415).
50116233 is a wasteful number, since it uses less digits than its factorization.
50116233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16705414.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 50116233 is about 7079.2819551138. The cubic root of 50116233 is about 368.6883996306.
Adding to 50116233 its reverse (33261105), we get a palindrome (83377338).
The spelling of 50116233 in words is "fifty million, one hundred sixteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •