Base | Representation |
---|---|
bin | 101110110000001101… |
… | …101001111101011011 |
3 | 11210120121001112112002 |
4 | 232300031221331123 |
5 | 1310302424310021 |
6 | 35021221511215 |
7 | 3425012354525 |
oct | 566015517533 |
9 | 153517045462 |
10 | 50201010011 |
11 | 1a321185929 |
12 | 989027250b |
13 | 49705bb969 |
14 | 26032d6a15 |
15 | 148c34d50b |
hex | bb0369f5b |
50201010011 has 4 divisors (see below), whose sum is σ = 50201755224. Its totient is φ = 50200264800.
The previous prime is 50201010001. The next prime is 50201010023. The reversal of 50201010011 is 11001010205.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11001010205 = 5 ⋅2200202041.
It is a cyclic number.
It is not a de Polignac number, because 50201010011 - 210 = 50201008987 is a prime.
It is a super-2 number, since 2×502010100112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50201009974 and 50201010001.
It is not an unprimeable number, because it can be changed into a prime (50201010001) 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, 260270 + ... + 410051.
It is an arithmetic number, because the mean of its divisors is an integer number (12550438806).
Almost surely, 250201010011 is an apocalyptic number.
50201010011 is a deficient number, since it is larger than the sum of its proper divisors (745213).
50201010011 is an equidigital number, since it uses as much as digits as its factorization.
50201010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 745212.
The product of its (nonzero) digits is 10, while the sum is 11.
Adding to 50201010011 its reverse (11001010205), we get a palindrome (61202020216).
The spelling of 50201010011 in words is "fifty billion, two hundred one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •