Base | Representation |
---|---|
bin | 10101011011010010… |
… | …10100010100100111 |
3 | 1002200200100022221011 |
4 | 22231221110110213 |
5 | 142024311132403 |
6 | 5141242003051 |
7 | 555026535340 |
oct | 125551242447 |
9 | 32620308834 |
10 | 11503224103 |
11 | 49732a7588 |
12 | 22904a6487 |
13 | 111426b0a7 |
14 | 7b1a650c7 |
15 | 474d42a6d |
hex | 2ada54527 |
11503224103 has 8 divisors (see below), whose sum is σ = 13426255872. Its totient is φ = 9650120856.
The previous prime is 11503224079. The next prime is 11503224107. The reversal of 11503224103 is 30142230511.
It is a happy number.
11503224103 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 11503224103 - 221 = 11501126951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11503224107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17481775 + ... + 17482432.
It is an arithmetic number, because the mean of its divisors is an integer number (1678281984).
Almost surely, 211503224103 is an apocalyptic number.
11503224103 is a deficient number, since it is larger than the sum of its proper divisors (1923031769).
11503224103 is an equidigital number, since it uses as much as digits as its factorization.
11503224103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34964261.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 11503224103 its reverse (30142230511), we get a palindrome (41645454614).
The spelling of 11503224103 in words is "eleven billion, five hundred three million, two hundred twenty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.278 sec. • engine limits •