Base | Representation |
---|---|
bin | 101110101010110100… |
… | …001101000110000111 |
3 | 11210100021122201102111 |
4 | 232222310031012013 |
5 | 1310111233431403 |
6 | 35004224521451 |
7 | 3422532546355 |
oct | 565264150607 |
9 | 153307581374 |
10 | 50110452103 |
11 | 1a285053388 |
12 | 9865a80287 |
13 | 4957902aba |
14 | 25d52827d5 |
15 | 148441156d |
hex | baad0d187 |
50110452103 has 8 divisors (see below), whose sum is σ = 51025705472. Its totient is φ = 49203334656.
The previous prime is 50110452079. The next prime is 50110452113. The reversal of 50110452103 is 30125401105.
It is a happy number.
50110452103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50110452103 - 25 = 50110452071 is a prime.
It is a super-2 number, since 2×501104521032 (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 (50110452113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2021550 + ... + 2046187.
It is an arithmetic number, because the mean of its divisors is an integer number (6378213184).
Almost surely, 250110452103 is an apocalyptic number.
50110452103 is a deficient number, since it is larger than the sum of its proper divisors (915253369).
50110452103 is a wasteful number, since it uses less digits than its factorization.
50110452103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4067961.
The product of its (nonzero) digits is 600, while the sum is 22.
Adding to 50110452103 its reverse (30125401105), we get a palindrome (80235853208).
The spelling of 50110452103 in words is "fifty billion, one hundred ten million, four hundred fifty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •