Base | Representation |
---|---|
bin | 101110101010110011… |
… | …000011110110100111 |
3 | 11210100021002110220101 |
4 | 232222303003312213 |
5 | 1310111144331403 |
6 | 35004214244531 |
7 | 3422530156624 |
oct | 565263036647 |
9 | 153307073811 |
10 | 50110152103 |
11 | 1a284968a50 |
12 | 9865956747 |
13 | 495782939b |
14 | 25d520534b |
15 | 14843a271d |
hex | baacc3da7 |
50110152103 has 16 divisors (see below), whose sum is σ = 55840264704. Its totient is φ = 44576215360.
The previous prime is 50110152067. The next prime is 50110152137. The reversal of 50110152103 is 30125101105.
It is a cyclic number.
It is not a de Polignac number, because 50110152103 - 29 = 50110151591 is a prime.
It is a super-2 number, since 2×501101521032 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50110162103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4206051 + ... + 4217947.
It is an arithmetic number, because the mean of its divisors is an integer number (3490016544).
Almost surely, 250110152103 is an apocalyptic number.
50110152103 is a deficient number, since it is larger than the sum of its proper divisors (5730112601).
50110152103 is a wasteful number, since it uses less digits than its factorization.
50110152103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20102.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 50110152103 its reverse (30125101105), we get a palindrome (80235253208).
The spelling of 50110152103 in words is "fifty billion, one hundred ten million, one hundred fifty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •